A min-max relation for the partial q- colourings of a graph. Part II: Box perfection
- 31 December 1989
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 74 (1-2) , 15-27
- https://doi.org/10.1016/0012-365x(89)90194-5
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Characterizations of strongly chordal graphsDiscrete Mathematics, 1983
- A Min-Max Relation for Submodular Functions on GraphsPublished by Elsevier ,1977
- Some partitions associated with a partially ordered setJournal of Combinatorial Theory, Series A, 1976
- The structure of sperner k-familiesJournal of Combinatorial Theory, Series A, 1976
- On certain polytopes associated with graphsJournal of Combinatorial Theory, Series B, 1975
- On balanced matricesPublished by Springer Nature ,1974
- Balanced matricesMathematical Programming, 1972
- Anti-blocking polyhedraJournal of Combinatorial Theory, Series B, 1972
- Blocking and anti-blocking pairs of polyhedraMathematical Programming, 1971
- A Decomposition Theorem for Partially Ordered SetsAnnals of Mathematics, 1950