Bull-free weakly chordal perfectly orderable graphs

DOI10.1007/PL00013413MaRDI QIDQ5952386zbMATH OpenOpenAlexFDO

Authors Ryan Hayward

Publication date 9 January 2002

Published in Graphs and Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

anti-holebox partitionbull-free graphsChvátal's conjecturedoubly lexical orders

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• On the structure of bull-free perfect graphs. II: The weakly chordal case
• On a conjecture of Hoàng and Tu concerning perfectly orderable graphs
• Coloring Bull-Free Perfectly Contractile Graphs
• Recognizing bull-free perfect graphs
• On the structure of bull-free perfect graphs

Cited in

(7)

• Bichromatic \(P_{4}\)-composition schemes for perfect orderability
• Coloring Bull-Free Perfectly Contractile Graphs
• The perfection and recognition of bull-reducible Berge graphs
• Transitive orientations in bull-reducible Berge graphs
• Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs
• On the structure of bull-free perfect graphs. II: The weakly chordal case
• Perfectly contractile graphs and quadratic toric rings

This page was built for publication: Bull-free weakly chordal perfectly orderable graphs

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