scientific article; zbMATH DE number 1743833

zbMATH Open0989.05038MaRDI QIDQ4529311FDOQ4529311

Authors: Marek Kubale, K. Manuszewski, Krzysztof Giaro 

Publication date: 14 July 2002

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

heuristicgraph coloringhard to color graph

Mathematics Subject Classification ID

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

Cited In (6)

• Title not available (Why is that?)
• Sequential coloring versus Welsh-Powell bound
• An iV‐colour theorem for sequentially constructed planar graphs with myopic colouring
• Title not available (Why is that?)
• Hard-to-color graphs for connected sequential colorings
• The smallest hard-to-color graph 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 Q4529311)