Pages that link to "Item:Q752726"
From MaRDI portal
The following pages link to A min-max relation for the partial q-colourings of a graph. II: Box perfection (Q752726):
Displaying 10 items.
- Coflow polyhedra (Q1197009) (← links)
- Graph covers using \(t\)-colourable vertex sets. (Q1427470) (← links)
- On box-perfect graphs (Q1682206) (← links)
- Box-total dual integrality, box-integrality, and equimodular matrices (Q2039243) (← links)
- Temporal starvation in multi-channel CSMA networks: an analytical framework (Q2329626) (← links)
- Clique partitioning with value-monotone submodular cost (Q2339847) (← links)
- The maximum vertex coverage problem on bipartite graphs (Q2448919) (← links)
- Clique partitioning of interval graphs with submodular costs on the cliques (Q3004202) (← links)
- A Discrete Convex Min-Max Formula for Box-TDI Polyhedra (Q5085130) (← links)
- A weak box-perfect graph theorem (Q6615760) (← links)
