scientific article; zbMATH DE number 3841898

MaRDI QIDQ3312261zbMATH OpenFDO

Authors Marek Kubale

Publication date 1982

zbMATH Keywords

orderings of verticessequential coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Numerical experiences with graph coloring algorithms
• Some sequential graph colouring algorithms
• Sequential and distributed graph coloring algorithms with performance analysis in random graph spaces
• scientific article; zbMATH DE number 764415
• scientific article; zbMATH DE number 17674

Cited in

(12)

• Worst case analysis of a graph coloring algorithm
• Numerical experiences with graph coloring algorithms
• The smallest hard-to-color graph for the SL algorithm
• Interval vertex-coloring of a graph with forbidden colors
• Graph colouring algorithms
• scientific article; zbMATH DE number 3854439 (Why is no real title available?)
• Some sequential graph colouring algorithms
• A theoretical analysis of backtracking in the graph coloring problem
• Smallest-last ordering and clustering and graph coloring algorithms
• scientific article; zbMATH DE number 4085675 (Why is no real title available?)
• scientific article; zbMATH DE number 3894489 (Why is no real title available?)
• On graph coloring in a class of parallel local algorithms

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