On box-perfect graphs
From MaRDI portal
Publication:1682206
DOI10.1016/j.jctb.2017.07.001zbMath1375.05111arXiv1608.04572OpenAlexW2964281897MaRDI QIDQ1682206
Guoli Ding, Wenan Zang, Qiu-Lan Zhao
Publication date: 28 November 2017
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1608.04572
Related Items (5)
Box-total dual integrality and edge-connectivity ⋮ Box-total dual integrality, box-integrality, and equimodular matrices ⋮ When Is the Matching Polytope Box-Totally Dual Integral? ⋮ The Schrijver system of the flow cone in series-parallel graphs ⋮ Isolating a Vertex via Lattices: Polytopes with Totally Unimodular Faces
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A min-max relation for the partial q-colourings of a graph. II: Box perfection
- The strong perfect graph theorem
- Claw-free graphs. V. Global structure
- The box-TDI system associated with 2-edge connected spanning subgraphs
- Even pairs in Berge graphs
- Coflow polyhedra
- Some partitions associated with a partially ordered set
- A description of claw-free perfect graphs
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Recognizing Berge graphs
- Normal hypergraphs and the perfect graph conjecture
- On box totally dual integral polyhedra
- Parity Graphs
- Characterization of Totally Unimodular Matrices
- The Structure of Claw‐Free Perfect Graphs
- Transitiv orientierbare Graphen
- The structure of Sperner k-families
This page was built for publication: On box-perfect graphs
