A min-max relation for the partial q-colourings of a graph. II: Box perfection
From MaRDI portal
Publication:752726
DOI10.1016/0012-365X(89)90194-5zbMath0716.05027OpenAlexW2008297846MaRDI QIDQ752726
Publication date: 1989
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(89)90194-5
Programming involving graphs or networks (90C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Coloring of graphs and hypergraphs (05C15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (9)
A Discrete Convex Min-Max Formula for Box-TDI Polyhedra ⋮ On box-perfect graphs ⋮ Graph covers using \(t\)-colourable vertex sets. ⋮ The maximum vertex coverage problem on bipartite graphs ⋮ Clique partitioning of interval graphs with submodular costs on the cliques ⋮ Coflow polyhedra ⋮ Box-total dual integrality, box-integrality, and equimodular matrices ⋮ Temporal starvation in multi-channel CSMA networks: an analytical framework ⋮ Clique partitioning with value-monotone submodular cost
Cites Work
- On switching paths polyhedra
- Characterizations of strongly chordal graphs
- Coflow polyhedra
- Some partitions associated with a partially ordered set
- On certain polytopes associated with graphs
- Minimax relations for the partial q-colorings of a graph
- Anti-blocking polyhedra
- A characterization of perfect graphs
- Normal hypergraphs and the perfect graph conjecture
- A decomposition theorem for partially ordered sets
- On the facial structure of set packing polyhedra
- Balanced matrices
- Blocking and anti-blocking pairs of polyhedra
- The structure of Sperner k-families
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A min-max relation for the partial q-colourings of a graph. II: Box perfection
