Perfectly orderable graphs: A survey

MaRDI QIDQ2758336zbMATH OpenFDO

Authors Chính T. Hoàng

Publication date 25 September 2002

zbMATH Keywords

surveycharacterizationrecognitionsplit graphsperfect graphsperfectly orderable graphssuperbrittle graphsperfect orderingsplit-perfect graphs

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Structural characterization of families of graphs (05C75) Perfect graphs (05C17)

Recommendations

• New classes of perfectly orderable graphs
• On the complexity of recognizing a class of perfectly orderable graphs
• Some classes of perfectly orderable graphs
• Four classes of perfectly orderable graphs
• New properties of perfectly orderable graphs and strongly perfect graphs

Cited in

(11)

• A characterization of \(P_{4}\)-comparability graphs
• New classes of perfectly orderable graphs
• Perfectly orderable graphs are quasi-parity graphs: a short proof
• On the perfect orderability of unions of two graphs
• On opposition graphs, coalition graphs, and bipartite permutation graphs
• scientific article; zbMATH DE number 15158 (Why is no real title available?)
• The story of perfectly orderable graphs
• Characterization and recognition of some opposition and coalition graph classes
• On brittle graphs
• A note on strong perfectness of graphs
• On the complexity of recognizing a class of perfectly orderable graphs

This page was built for publication: Perfectly orderable graphs: A survey

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