Vertex coloring complete multipartite graphs from random lists of size 2

DOI10.1016/J.DISC.2010.07.013zbMath1222.05050OpenAlexW2039123376MaRDI QIDQ539865

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

zbMATH Keywords

complete multipartite graphlist coloringrandom list

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (3)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Colouring powers of cycles 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