A Brooks-type bound for squares of K4-minor-free graphs
نویسندگان
چکیده
Refining a bound by Lih, Wang and Zhu, we prove that if the square G2 of a K4-minor-free graph Gwith maximum degree∆ > 6 does not contain a complete subgraph on ⌊ 3 2∆ ⌋ + 1 vertices, then G2 is ⌊ 3 2∆ ⌋ -colorable. © 2009 Elsevier B.V. All rights reserved.
منابع مشابه
Distance constrained labelings of K4-minor free graphs
Motivated by previous results on distance constrained labelings and coloring of squares of K4-minor free graphs, we show that for every p ≥ q ≥ 1, there exists ∆0 such that every K4-minor free graph G with maximum degree ∆ ≥ ∆0 has an L(p, q)-labeling of span at most qb3∆(G)/2c. The obtained bound is the best possible.
متن کاملChoosability of Squares of K4-minor Free Graphs
Lih, Wang and Zhu [Discrete Math. 269 (2003), 303–309] proved that the chromatic number of the square of a K4-minor free graph with maximum degree ∆ is bounded by ⌊3∆/2⌋+1 if ∆ ≥ 4, and is at most ∆+3 for ∆ ∈ {2, 3}. We show that the same bounds hold for the list chromatic number of squares of K4-minor free graphs. The same result was also proved independently by Hetherington and Woodall.
متن کاملHomomorphism bounds and edge-colourings of K4-minor-free graphs
We present a necessary and sufficient condition for a graph of odd-girth 2k + 1 to bound the class of K4-minor-free graphs of odd-girth (at least) 2k + 1, that is, to admit a homomorphism from any such K4-minor-free graph. This yields a polynomial-time algorithm to recognize such bounds. Using this condition, we first prove that every K4-minor free graph of odd-girth 2k+1 admits a homomorphism ...
متن کامل-λ coloring of graphs and Conjecture Δ ^ 2
For a given graph G, the square of G, denoted by G2, is a graph with the vertex set V(G) such that two vertices are adjacent if and only if the distance of these vertices in G is at most two. A graph G is called squared if there exists some graph H such that G= H2. A function f:V(G) {0,1,2…, k} is called a coloring of G if for every pair of vertices x,yV(G) with d(x,y)=1 we have |f(x)-f(y)|2 an...
متن کاملDensity of universal classes of series-parallel graphs
A class of graphs C ordered by the homomorphism relation is universal if every countable partial order can be embedded in C. It was shown in [1] that the class Ck of k-colorable graphs, for any fixed k ≥ 3, induces a universal partial order. In [4], a surprisingly small subclass of C3 which is a proper subclass of K4-minor-free graphs (G/K4) is shown to be universal. In another direction, a den...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 309 شماره
صفحات -
تاریخ انتشار 2009