Consecutive colorings of graphs

DOI10.1007/BF01920567zbMath0633.05027MaRDI QIDQ3770560

Dominique de Werra, Alain Hertz

Publication date: 1988

Published in: Zeitschrift für Operations Research (Search for Journal in Brave)

zbMATH Keywords

bounds; perfect graphs; node colorings

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

05C15: Coloring of graphs and hypergraphs

Related Items

Coloration de graphes : fondements et applications, Unnamed Item, About equivalent interval colorings of weighted graphs, Cycle-based facets of chromatic scheduling polytopes, Facet-inducing inequalities for chromatic scheduling polytopes based on covering cliques, Exact colouring algorithm for weighted graphs applied to timetabling problems with lectures of different lengths, Chromatic scheduling and frequency assignment, On the use of some known methods for \(T\)-colorings of graphs, Chromatic scheduling polytopes coming from the bandwidth allocation problem in point-to-multipoint radio access systems, On the combinatorial structure of chromatic scheduling polytopes

Cites Work

• A note on strong perfectness of graphs
• 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
• An inequality for the chromatic number of a graph
• Unnamed Item