Every Planar Graph Is 5-Choosable
نویسندگان
چکیده
منابع مشابه
Every 2-choosable graph is circular consecutive 2-choosable
Suppose G is a graph, r is a positive real number and S(r) is a circle of perimeter r. For a positive real number t ≤ r, a (t, r)circular consecutive colour-list assignment L is a mapping that assigns to each vertex v of G an interval L(v) of S(r) of length t. A circular L-colouring of G is a mapping f : V (G) → S(r) such that for each vertex v, f(v) ∈ L(v) and for each edge uv, the distance be...
متن کاملEvery planar graph without cycles of lengths 4 to 12 is acyclically 3-choosable
An acyclic coloring of a graph G is a coloring of its vertices such that : (i) no two adjacent vertices in G receive the same color and (ii) no bicolored cycles exist in G. A list assignment of G is a function L that assigns to each vertex v ∈ V (G) a list L(v) of available colors. Let G be a graph and L be a list assignment of G. The graph G is acyclically L-list colorable if there exists an a...
متن کاملEvery toroidal graph without adjacent triangles is (4, 1)*-choosable
In this paper, a structural theorem about toroidal graphs is given that strengthens a result of Borodin on plane graphs. As a consequence, it is proved that every toroidal graph without adjacent triangles is (4, 1)∗-choosable. This result is best possible in the sense that K7 is a non-(3, 1)∗-choosable toroidal graph. A linear time algorithm for producing such a coloring is presented also. © 20...
متن کاملLocally planar graphs are 5-choosable
It is proved that every graph embedded in a fixed surface with sufficiently large edge-width is 5-choosable.
متن کاملEvery 5 - connected planar triangulation is 4 - ordered
A graph G is said to be 4-ordered if for any ordered set of four distinct vertices of G, there exists a cycle in G that contains all of the four vertices in the designated order. Furthermore, if we can find such a cycle as a Hamiltonian cycle, G is said to be 4-ordered Hamiltonian. It was shown that every 4-connected planar triangulation is (i) Hamiltonian (by Whitney) and (ii) 4-ordered (by Go...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1994
ISSN: 0095-8956
DOI: 10.1006/jctb.1994.1062