scientific article; zbMATH DE number 1743833

MaRDI QIDQ4529311zbMATH OpenFDO

Authors Marek Kubale, K. Manuszewski, Krzysztof Giaro

Publication date 14 July 2002

zbMATH Keywords

heuristicgraph coloringhard to color graph

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1594518
• Hard-to-color graphs for connected sequential colorings
• The smallest hard-to-color graph
• scientific article; zbMATH DE number 764415
• Some sequential graph colouring algorithms
• The smallest hard-to-color graph for algorithm DSATUR
• Publication:4942486
• Sequential colorings and perfect graphs
• The smallest hard-to-color graph for the SL algorithm
• Consecutive colorings of graphs

Cited in

(6)

• scientific article; zbMATH DE number 764415 (Why is no real title available?)
• scientific article; zbMATH DE number 1452707 (Why is no real title available?)
• The smallest hard-to-color graph for the SL algorithm
• Sequential coloring versus Welsh-Powell bound
• An iV‐colour theorem for sequentially constructed planar graphs with myopic colouring
• Hard-to-color graphs for connected sequential colorings

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 Q4529311)