Vertex coloring complete multipartite graphs from random lists of size 2

DOI10.1016/J.DISC.2010.07.013zbMATH Open1222.05050OpenAlexW2039123376MaRDI QIDQ539865FDOQ539865

Authors: Carl Johan Casselgren 

Publication date: 31 May 2011

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2010.07.013

Recommendations

• Coloring complete bipartite graphs from random lists
• Coloring complete and complete bipartite graphs from random lists
• Coloring graphs from random lists of fixed size
• Coloring graphs from random lists of size 2
• Coloring graphs of various maximum degree from random lists

zbMATH Keywords

list coloringcomplete multipartite graphrandom list

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Title not available (Why is that?)
• The probabilistic method. With an appendix on the life and work of Paul Erdős.
• Title not available (Why is that?)
• Colouring powers of cycles from random lists
• Coloring complete bipartite graphs from random lists
• Multicriterial graph problems with MAXMIN criterion

Cited In (6)

• Coloring complete and complete bipartite graphs from random lists
• Coloring graphs from random lists of fixed size
• Coloring graphs from random lists of size 2
• Choosability with separation of complete multipartite graphs and hypergraphs
• Coloring hypergraphs from random lists
• Coloring complete bipartite graphs from random lists

This page was built for publication: Vertex coloring complete multipartite 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 Q539865)