Sequential coloring versus Welsh-Powell bound

DOI10.1016/0012-365X(89)90212-4MaRDI QIDQ1121275zbMATH OpenFDO

Authors Maciej M. Sysło

Publication date 1989

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365X(89)90212-4

zbMATH Keywords

chromatic numbersequential coloring algorithmWelsh-Powell upper bound

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Review text

In this note some remarks are made on the relations between chromatic number, the number of colors used by the sequential coloring algorithm and the Welsh-Powell upper bound for the chromatic number of a graph.

Recommendations

• A sequential coloring algorithm for finite sets
• Sequential colorings and perfect graphs
• Some sequential graph colouring algorithms
• Connected sequential colourings
• Hard-to-color graphs for connected sequential colorings
• Consecutive colorings of graphs
• scientific article; zbMATH DE number 1743833
• scientific article; zbMATH DE number 1594518
• On the Complexity of Ordered Colorings
• Tight lower bounds for the complexity of multicoloring

Cites work

• An upper bound for the chromatic number of a graph and its application to timetabling problems
• scientific article; zbMATH DE number 3918092 (Why is no real title available?)
• scientific article; zbMATH DE number 3482375 (Why is no real title available?)

Cited in

(2)

• The smallest hard-to-color graph
• A sequential coloring algorithm for finite sets

This page was built for publication: Sequential coloring versus Welsh-Powell bound

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