Equitable List Coloring of Graphs with Bounded Degree
نویسندگان
چکیده
A graph G is equitably k-choosable if for every k-list assignment L there exists an L-coloring of G such that every color class has at most d|G|/ke vertices. We prove results towards the conjecture that every graph with maximum degree at most r is equitably (r+1)choosable. In particular, we con rm the conjecture for r ≤ 7 and show that every graph with maximum degree at most r and at least r vertices is equitably (r + 2)-choosable. Our proofs yield polynomial algorithms for corresponding equitable list colorings. Mathematics Subject Classi cation: 05C15, 05C35.
منابع مشابه
k-forested choosability of graphs with bounded maximum average degree
A proper vertex coloring of a simple graph is $k$-forested if the graph induced by the vertices of any two color classes is a forest with maximum degree less than $k$. A graph is $k$-forested $q$-choosable if for a given list of $q$ colors associated with each vertex $v$, there exists a $k$-forested coloring of $G$ such that each vertex receives a color from its own list. In this paper, we prov...
متن کاملEquitable List Coloring of Graphs
A graph G is equitably k-choosable if, for any k-uniform list assignment L, G admits a proper coloring π such that π(v) ∈ L(v) for all v ∈ V (G) and each color appears on at most |G|/k vertices. It was conjectured in [8] that every graph G with maximum degree ∆ is equitably k-choosable whenever k ≥ ∆ + 1. We prove the conjecture for the following cases: (i) ∆ ≤ 3; (ii) k ≥ (∆ − 1). Moreover, eq...
متن کاملFilling the Complexity Gaps for Colouring Planar and Bounded Degree Graphs
We consider a natural restriction of the List Colouring problem: k-Regular List Colouring, which corresponds to the List Colouring problem where every list has size exactly k. We give a complete classification of the complexity of k-Regular List Colouring restricted to planar graphs, planar bipartite graphs, planar triangle-free graphs and to planar graphs with no 4-cycles and no 5-cycles. We a...
متن کاملEquitable Colorings of Bounded Treewidth Graphs
A proper coloring of a graph G is equitable if the sizes of any two color classes are differ by at most one. The related notion is `-bounded coloring where each of the color classes is of cardinality ≤ `. We consider the problems to determine for a given graph G (and a given integer `) whether G has an equitable (`-bounded) coloring. We prove that both problems can be solved in polynomial time ...
متن کاملList coloring the square of sparse graphs with large degree
We consider the problem of coloring the squares of graphs of bounded maximum average degree, that is, the problem of coloring the vertices while ensuring that two vertices that are adjacent or have a common neighbour receive different colors. Borodin et al. proved in 2004 and 2008 that the squares of planar graphs of girth at least seven and sufficiently large maximum degree ∆ are list (∆ + 1)-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Graph Theory
دوره 74 شماره
صفحات -
تاریخ انتشار 2013