Coloring graphs from random lists of size 2

DOI10.1016/j.ejc.2011.09.040zbMath1233.05099OpenAlexW2036951881MaRDI QIDQ658000

Carl Johan Casselgren

Publication date: 11 January 2012

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2011.09.040

zbMATH Keywords

asymptotic probability

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Coloring of graphs and hypergraphs (05C15)

Related Items

Coloring complete and complete bipartite graphs from random lists ⋮ Coloring graphs from random lists of fixed size

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Vertex coloring complete multipartite graphs from random lists of size 2
• Colouring powers of cycles from random lists
• Coloring complete bipartite graphs from random lists