A note on strong perfectness of graphs

DOI10.1007/BF02591953MaRDI QIDQ3714102zbMATH OpenOpenAlexFDO

Authors 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

brittle graphperfect ordersequential colouringvicinal preorder

Mathematics Subject Classification ID

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

Recommendations

• On brittle graphs
• New properties of perfectly orderable graphs and strongly perfect graphs
• All variations on perfectly orderable graphs
• Locally perfect graphs
• Perfectly orderable graphs: A survey

Cites work

• A note on superbrittle graphs
• Complement reducible graphs
• scientific article; zbMATH DE number 3889565 (Why is no real title available?)
• scientific article; zbMATH DE number 3891425 (Why is no real title available?)
• scientific article; zbMATH DE number 3400923 (Why is no real title available?)
• Nombre chromatique et plus longs chemins d'un graphe
• Some perfect coloring properties of graphs

Cited in

(12)

• A semi-strong perfect graph theorem
• Locally perfect graphs
• A fast algorithm for coloring Meyniel graphs
• Connected sequential colourings
• Note on the perfect EIC-graphs
• Bichromatic \(P_{4}\)-composition schemes for perfect orderability
• scientific article; zbMATH DE number 3887731 (Why is no real title available?)
• Consecutive colorings of graphs
• On brittle graphs
• A note on strong and co-strong perfectness of the X-join of graphs
• Strong T-Perfection of Bad-K₄ -Free Graphs
• A generalization of simplicial elimination orderings

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

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