Diameter of 4-colourable graphs
نویسندگان
چکیده
We prove that for every connected 4-colourable graph G of order n and minimum degree δ ≥ 1, diam(G) ≤ 5n 2δ − 1. This is a first step toward proving a conjecture of Erdős, Pach, Pollack and Tuza [4] from 1989.
منابع مشابه
Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs
A k-colouring of a graph G = (V,E) is a mapping c : V → {1, 2, . . . , k} such that c(u) 6= c(v) whenever uv is an edge. The reconfiguration graph of the k-colourings of G contains as its vertex set the k-colourings of G, and two colourings are joined by an edge if they differ in colour on just one vertex of G. We introduce a class of k-colourable graphs, which we call k-colour-dense graphs. We...
متن کامل(Delta-k)-critical graphs
Every graphG of maximum degree is ( +1)-colourable and a classical theorem of Brooks states that G is not -colourable iff G has a ( + 1)-clique or = 2 and G has an odd cycle. Reed extended Brooks’ Theorem by showing that if (G) 1014 then G is not ( − 1)-colourable iff G contains a -clique. We extend Reed’s characterization of ( − 1)-colourable graphs and characterize ( − 2), ( −3), ( −4) and ( ...
متن کاملEvery circle graph of girth at least 5 is 3-colourable
It is known that every triangle-free (equivalently, of girth at least 4) circle graph is 5-colourable (Kostochka, 1988) and that there exist examples of these graphs which are not 4-colourable (Ageev, 1996). In this note we show that every circle graph of girth at least 5 is 2-degenerate and, consequently, not only 3-colourable but even 3-choosable.
متن کامل5-colouring graphs with 4 crossings
We disprove a conjecture of Oporowski and Zhao stating that every graph with crossing number at most 5 and clique number at most 5 is 5-colourable. However, we show that every graph with crossing number at most 4 and clique number at most 5 is 5-colourable. We also show some colourability results on graphs that can be made planar by removing few edges. In particular, we show that if a graph wit...
متن کاملPolarity and Monopolarity of $3$-colourable comparability graphs
We sharpen the result that polarity and monopolarity are NP-complete problems by showing that they remain NP-complete if the input graph is restricted to be a 3-colourable comparability graph. We start by presenting a construction reducing 1-3-SAT to monopolarity of 3-colourable comparability graphs. Then we show that polarity is at least as hard as monopolarity for input graphs restricted to a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Eur. J. Comb.
دوره 30 شماره
صفحات -
تاریخ انتشار 2009