Completing Partial Proper Colorings using Hall's Condition
نویسندگان
چکیده
In the context of list-coloring the vertices of a graph, Hall’s condition is a generalization of Hall’s Marriage Theorem and is necessary (but not sufficient) for a graph to admit a proper list-coloring. The graph G with list assignment L satisfies Hall’s condition if for each subgraph H of G, the inequality |V (H)| 6∑σ∈C α(H(σ, L)) is satisfied, where C is the set of colors and α(H(σ, L)) is the independence number of the subgraph of H induced on the set of vertices having color σ in their lists. A list assignment L to a graph G is called Hall if (G,L) satisfies Hall’s condition. A graph G is Hall m-completable for some m > χ(G) if every partial proper m-coloring of G whose corresponding list assignment is Hall can be extended to a proper coloring of G. In 2011, Bobga et al. posed the following questions: (1) Are there examples of graphs that are Hall m-completable, but not Hall (m+ 1)-completable for some m > 3? (2) If G is neither complete nor an odd cycle, is G Hall ∆(G)-completable? This paper establishes that for every m > 3, there exists a graph that is Hall mcompletable but not Hall (m+ 1)-completable and also that every bipartite planar graph G is Hall ∆(G)-completable.
منابع مشابه
Extending Hall's Theorem into List Colorings: A Partial History
In 1988, A. J. W. Hilton and P. D. Johnson Jr. found a natural generalization of the condition in Philip Hall’s celebrated theorem on systems of distinct representatives. This generalization was formed in the relatively new theory of list colorings of graphs. Here we give an account of a strand of development arising from this generalization, concentrating on extensions of Hall’s theorem. New r...
متن کاملRestricted extension of sparse partial edge colorings of hypercubes
We consider the following type of question: Given a partial proper d-edge coloring of the d-dimensional hypercube Qd, and lists of allowed colors for the non-colored edges of Qd, can we extend the partial coloring to a proper d-edge coloring using only colors from the lists? We prove that this question has a positive answer in the case when both the partial coloring and the color lists satisfy ...
متن کاملCompleting partial latin squares: Cropper's question
Hall’s condition is a well-known necessary condition for the existence of a proper coloring of a graph from prescribed lists. Completing a partial latin square is a very special kind of graph list-coloring problem. Cropper’s question was: is Hall’s condition sufficient for the existence of a completion of a partial latin square? The folk belief that the answer must be no is confirmed here, but,...
متن کاملOn Approximately Counting Colorings of Small Degree Graphs
We consider approximate counting of colorings of an n-vertex graph using rapidly mixing Markov chains. It has been shown by Jerrum and by Salas and Sokal that a simple random walk on graph colorings would mix rapidly, provided the number of colors k exceeded the maximum degree ∆ of the graph by a factor of at least 2. We prove that this is not a necessary condition for rapid mixing by consideri...
متن کاملPattern Hypergraphs
The notion of pattern hypergraph provides a unified view of several previously studied coloring concepts. A pattern hypergraph H is a hypergraph where each edge is assigned a type Πi that determines which of possible colorings of the edge are proper. A vertex coloring of H is proper if it is proper for every edge. In general, the set of integers k such that H can be properly colored with exactl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 22 شماره
صفحات -
تاریخ انتشار 2015