Coloring graphs from random lists of fixed size

DOI10.1002/rsa.20469zbMath1290.05072OpenAlexW1985480794MaRDI QIDQ5415594

Carl Johan Casselgren

Publication date: 13 May 2014

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-107123

zbMATH Keywords

list coloringrandom list

Mathematics Subject Classification ID

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

Related Items (1)

Coloring complete and complete bipartite graphs from random lists

Cites Work

• Vertex coloring complete multipartite graphs from random lists of size 2
• Coloring graphs from random lists of size 2
• Colouring powers of cycles from random lists
• Coloring complete bipartite graphs from random lists
• Cores in random hypergraphs and Boolean formulas

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