Coloring complete and complete bipartite graphs from random lists

DOI10.1007/s00373-015-1587-5zbMath1339.05120OpenAlexW596576939MaRDI QIDQ292251

Carl Johan Casselgren, Roland Haeggkvist

Publication date: 13 June 2016

Published in: Graphs and Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

complete bipartite graphcomplete graphlist coloringcoloring from random listsrandom list

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (2)

Thresholds for Latin squares and Steiner triple systems: Bounds within a logarithmic factor ⋮ On the threshold problem for Latin boxes

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• The list chromatic index of a bipartite multigraph
• Coloring complete bipartite graphs from random lists
• Avoiding Arrays of Odd Order by Latin Squares
• Coloring graphs from random lists of fixed size

This page was built for publication: Coloring complete and complete bipartite graphs from random lists