A weak box-perfect graph theorem

DOI10.1016/J.JCTB.2024.07.006MaRDI QIDQ6615760zbMATH OpenFDO

Authors Patrick Chervet, Roland Grappe

Publication date 8 October 2024

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.JCTB.2024.07.006

zbMATH Keywords

box-perfect graphscomplete joinperfect graphs

Mathematics Subject Classification ID

Perfect graphs (05C17) Graph operations (line graphs, products, etc.) (05C76)

Recommendations

• On box-perfect graphs
• A note on perfect graphs
• The strong perfect graph theorem
• A min-max relation for the partial q-colourings of a graph. II: Box perfection
• A semi-strong perfect graph theorem

Cites work

• A min-max relation for the partial q-colourings of a graph. II: Box perfection
• Anti-blocking polyhedra
• Box-total dual integrality, box-integrality, and equimodular matrices
• scientific article; zbMATH DE number 3580570 (Why is no real title available?)
• Normal hypergraphs and the perfect graph conjecture
• On box totally dual integral polyhedra
• On box-perfect graphs
• On certain polytopes associated with graphs

This page was built for publication: A weak box-perfect graph theorem

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