A note on strong perfectness of graphs

DOI10.1007/BF02591953zbMath0587.05028OpenAlexW1967044852MaRDI QIDQ3714102

Dominique de Werra, Myriam Preissmann

Publication date: 1985

Published in: Mathematical Programming (Search for Journal in Brave)

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

zbMATH Keywords

sequential colouringperfect ordervicinal preorderbrittle graph

Mathematics Subject Classification ID

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

Related Items (4)

Locally perfect graphs ⋮ A fast algorithm for coloring Meyniel graphs ⋮ Connected sequential colourings ⋮ Consecutive colorings of graphs

Cites Work

• A note on superbrittle graphs
• Some perfect coloring properties of graphs
• Complement reducible graphs
• Nombre chromatique et plus longs chemins d'un graphe
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A note on strong perfectness of graphs