Consecutive colorings of graphs

DOI10.1007/BF01920567MaRDI QIDQ3770560zbMATH OpenOpenAlexFDO

Authors Dominique De Werra, Alain Hertz

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

boundsnode coloringsperfect graphs

Mathematics Subject Classification ID

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

Recommendations

• Consecutive colorings of the edges of general graphs
• 3-consecutive C-colorings of graphs
• scientific article; zbMATH DE number 1161387
• scientific article; zbMATH DE number 1409249
• 3-consecutive edge coloring of a graph

Cites work

• A note on strong perfectness of graphs
• An inequality for the chromatic number of a graph
• An upper bound for the chromatic number of a graph and its application to timetabling problems
• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• Smallest-last ordering and clustering and graph coloring algorithms

Cited in

(15)

• Cycle-based facets of chromatic scheduling polytopes
• Facet-inducing inequalities for chromatic scheduling polytopes based on covering cliques
• Sequential coloring versus Welsh-Powell bound
• Exact colouring algorithm for weighted graphs applied to timetabling problems with lectures of different lengths
• Chromatic scheduling and frequency assignment
• Hard-to-color graphs for connected sequential colorings
• 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
• 3-consecutive C-colorings of graphs
• scientific article; zbMATH DE number 1743833 (Why is no real title available?)
• Coloration de graphes : fondements et applications
• scientific article; zbMATH DE number 2230222 (Why is no real title available?)
• A polyhedral study of a relaxation of the routing and spectrum allocation problem
• About equivalent interval colorings of weighted graphs

This page was built for publication: Consecutive colorings of graphs

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