Coloring graphs from random lists of size 2

DOI10.1016/J.EJC.2011.09.040zbMATH Open1233.05099OpenAlexW2036951881MaRDI QIDQ658000FDOQ658000

Authors: 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

Recommendations

• Coloring graphs from random lists of fixed size
• Coloring graphs of various maximum degree from random lists
• Coloring complete and complete bipartite graphs from random lists
• Coloring complete bipartite graphs from random lists
• Colouring powers of cycles from random lists

zbMATH Keywords

asymptotic probability

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Colouring powers of cycles from random lists
• Coloring complete bipartite graphs from random lists
• Vertex coloring complete multipartite graphs from random lists of size 2
• Multicriterial graph problems with MAXMIN criterion

Cited In (10)

• Coloring graphs of various maximum degree from random lists
• Coloring complete and complete bipartite graphs from random lists
• The local nature of list colorings for graphs of high girth
• Coloring graphs from random lists of fixed size
• Vertex coloring complete multipartite graphs from random lists of size 2
• The Local Nature of List Colorings for Graphs of High Girth
• Colouring powers of cycles from random lists
• Maximizing the chances of a color match
• Coloring hypergraphs from random lists
• Coloring complete bipartite graphs from random lists

This page was built for publication: Coloring graphs from random lists of size 2

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q658000)