The smallest hard-to-color graph for the SL algorithm

DOI10.1016/S0012-365X(96)00052-0zbMath0877.05021MaRDI QIDQ1356706

Marek Kubale, Konrad Piwakowski, Jarosław Pakulski

Publication date: 8 December 1997

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

zbMATH Keywords

graph-colouring algorithmnon-optimal colouring

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• The smallest hard-to-color graph
• Hard-to-color graphs for connected sequential colorings
• Sur le coloriage des graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The smallest hard-to-color graph for the SL algorithm