A sequential coloring algorithm for finite sets

DOI10.1016/S0012-365X(98)00340-9zbMath0924.05023OpenAlexW1977005762WikidataQ126472656 ScholiaQ126472656MaRDI QIDQ1297462

Sanming Zhou

Publication date: 3 November 1999

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(98)00340-9

zbMATH Keywords

hereditary propertyfinite setconditional chromatic numbersequential coloring algorithmsequential coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Minimum partition of an independence system into independent sets

Cites Work

• Chromatic partitions of a graph
• Interpolation theorems for graphs, hypergraphs and matroids
• The subchromatic number of a graph
• The point-arboricity of a graph
• Hereditary properties of raphs
• An interpolation theorem for partitions which are complete with respect to hereditary properties
• Bounds for the vertex linear arboricity
• On generalized graph colorings
• Smallest-last ordering and clustering and graph coloring algorithms
• An upper bound for the chromatic number of a graph and its application to timetabling problems
• Bounds for the chromatic number of a graph
• COVERING AND PACKING IN GRAPHS, I.
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A sequential coloring algorithm for finite sets