scientific article; zbMATH DE number 975381

MaRDI QIDQ5284054zbMATH OpenFDO

Authors Pierre Hansen, Julio Kuplinsky

Publication date 4 February 1997

zbMATH Keywords

algorithmslightly hard-to-color graphsvertex-coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 764415
• The smallest hard-to-color graph
• Publication:4942486

Cited in

(6)

• The smallest hard-to-color graph for the SL algorithm
• Well-hued graphs
• scientific article; zbMATH DE number 1594518 (Why is no real title available?)
• scientific article; zbMATH DE number 1419487 (Why is no real title available?)
• Using Hajós’ Construction to Generate Hard Graph 3-Colorability Instances
• Small hard-to-color graphs for the SL algorithm

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5284054)