Sequential colorings and perfect graphs

DOI10.1016/S0166-218X(99)00026-8zbMath0930.05041OpenAlexW1982847918MaRDI QIDQ1293205

Myriam Preissmann, Frédéric Maffray

Publication date: 9 February 2000

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

Full work available at URL: https://doi.org/10.1016/s0166-218x(99)00026-8

zbMATH Keywords

chromatic numberperfect graphscoloringbichromatic interchange

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Perfect graphs (05C17)

Related Items

Gridline graphs: A review in two dimensions and an extension to higher dimensions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On rigid circuit graphs
• Coloring perfect \((K_ 4\)-e)-free graphs
• A characterization of perfect graphs
• On a property of the class of n-colorable graphs
• A Linear Recognition Algorithm for Cographs
• A generalization of simplicial elimination orderings