Bull-free weakly chordal perfectly orderable graphs

DOI10.1007/PL00013413zbMath1010.05028OpenAlexW2054082603MaRDI QIDQ5952386

Ryan B. 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

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

Related Items (5)

Perfectly contractile graphs and quadratic toric rings ⋮ Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs ⋮ Transitive orientations in bull-reducible Berge graphs ⋮ The perfection and recognition of bull-reducible Berge graphs ⋮ Bichromatic \(P_{4}\)-composition schemes for perfect orderability

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