A min-max relation for the partial q-colourings of a graph. II: Box perfection (Q752726)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A min-max relation for the partial q-colourings of a graph. II: Box perfection |
scientific article; zbMATH DE number 4179406
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A min-max relation for the partial q-colourings of a graph. II: Box perfection |
scientific article; zbMATH DE number 4179406 |
Statements
A min-max relation for the partial q-colourings of a graph. II: Box perfection (English)
0 references
1989
0 references
box perfection
0 references
totally unimodular matrix
0 references
min-max equality
0 references
linear program
0 references
comparability graphs
0 references
