The smallest hard-to-color graph for algorithm DSATUR

DOI10.1016/S0012-365X(00)00439-8zbMath0999.05038MaRDI QIDQ5959099

Konrad Piwakowski, Marek Kubale, K. Manuszewski, Robert Janczewski

Publication date: 2 December 2002

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

zbMATH Keywords

algorithmchromatic numberhard-to-color

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Vertex coloring of a graph for memory constrained scenarios, Graph theoretic algorithm for automatic operation sequencing for progressive die design, DSATUR