Fractional and integral colourings
From MaRDI portal
Publication:1363414
DOI10.1007/BF02614444zbMath0878.05034OpenAlexW2020035774MaRDI QIDQ1363414
Publication date: 5 January 1998
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02614444
Related Items (3)
Fractional and integral colourings ⋮ Unnamed Item ⋮ Approximate strong separation with application in fractional graph coloring and preemptive scheduling.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A min-max relation for stable sets in graphs with no odd-\(K_ 4\)
- Matrices with the Edmonds-Johnson property
- On the stable set polytope of a series-parallel graph
- Polytope des independants d'un graphe série-parallèle
- On Tutte's extension of the four-colour problem
- Hajos' graph-coloring conjecture: Variations and counterexamples
- Fractional and integral colourings
- Topology of series-parallel networks
- Anti-blocking polyhedra
- Normal hypergraphs and the perfect graph conjecture
- Colouring series-parallel graphs
- Integer Rounding for Polymatroid and Branching Optimization Problems
- On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
- Compositions of Graphs and Polyhedra II: Stable Sets
- Compositions of Graphs and Polyhedra III: Graphs with No $W_4 $ Minor
- Subdivisions and the chromatic index ofr-graphs
- A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
This page was built for publication: Fractional and integral colourings
