Consecutive colorings of graphs

DOI10.1007/BF01920567zbMath0633.05027OpenAlexW1970740250MaRDI QIDQ3770560

Alain Hertz, Dominique de Werra

Publication date: 1988

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

Full work available at URL: https://doi.org/10.1007/bf01920567

zbMATH Keywords

boundsperfect graphsnode colorings

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Related Items

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

Cites Work

• Unnamed Item
• 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