Fractional and integral colourings

Mathematical Programming, Series B

Volumn 76, Issue 2, 1997, Pages 333-347

  Kilakos, K ^a   Marcotte, O ^b  

^a LONDON SCHOOL OF ECONOMICS   (United Kingdom)

^b UNIVERSITÉ DU QUÉBEC À MONTRÉAL   (Canada)

Author keywords

Chromatic number; Graph colouring; Integer rounding; Stable set

Indexed keywords

EID: 0038638511     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02614444     Document Type: Article

References (24)

1. F. Barahona and A.R. Mahjoub, Compositions of graphs and polyhedra II: stable sets, SIAM J. Disc. Math. 7 (1994) 359-371.
2. 4 minor, SIAM J. Disc. Math. 7 (1994) 372-389.
3. S. Baum and L.E. Trotter Jr., Integer rounding for polymatroid and branching optimization problems, SIAM J. Algebraic and Disc. Methods 2 (1981) 416-425.
4. J.A. Bondy and U.S.R. Murty, Graph Theory with Applications (North Holland, New York, 1976).
5. M. Boulala and J.-P. Uhry, Polytope des indépendants d'un graphe série-parallèle, Disc. Math. 27 (1979) 225-243.
6. P.A. Catlin, Hajös graph-colouring conjecture: variations and counterexamples, J. Comb. Theory (B) 26 (1979) 268-274.
7. G. Dirac, A property of 4-chromatic graphs and remarks on critical graphs, J. London Math. Society 27 (1952) 85-92.
8. R.J. Duffin, Topology of series parallel networks, J. Math. Anal. Appl. 10 (1965) 308-318.
9. D.R. Fulkerson, Anti-blocking polyhedra, J. Comb. Theory (B) 12 (1972) 125-130.
10. 4, J. Comb. Theory (B) 47 (1989) 330-348.
11. A.M.H. Gerards and A. Schrijver, Matrices with the Edmonds-Johnson property, Combinatorial 6 (1986) 365-379.
12. M.K. Goldberg, On multigraphs with almost maximal chromatic class, Diskret. Analiz. 23 (1973) 3-7 (in Russian).
13. R. Halin, Graphentheorie II (Wissenschaftliche Buchgesellschaft, Darmstadt, 1981).
14. T.R. Jensen and B. Toft, Graph Coloring Problems (Wiley, 1995).
15. K. Kilakos, Colourings and fractional colourings, Ph.D. Thesis, University of Waterloo (1993).
16. K. Kilakos and B. Shepherd, Subdivisions and the chromatic index of r-graphs, J. Graph Theory 22 (1996) 203-212.
17. L. Lovász, Normal hypergraphs and the perfect graph conjecture, Disc. Math. 2 (1972) 253-276.
18. A.R. Mahjoub, On the stable set polytope of a series-parallel graph, Math. Prog. 40 (1988) 53-57.
19. O. Marcotte, Exact edge-colourings of graphs without prescribed minors, in: W. Cook and P.D. Seymour, eds., DIMACS Series in Discrete Mathematics and Theoretical Computer Science I. Polyhedral Combinatorics (1990) 235-243.
20. O. Marcotte, On the chromatic index of multigraphs and a conjecture of Seymour (II), in: W. Cook and P.D. Seymour, eds., DIMACS Series in Discrete Mathematics and Theoretical Computer Science I. Polyhedral Combinatorics (1990) 245-279.
21. P.D. Seymour, On multi-colourings of cubic graphs and conjectures of Fulkerson and Tutte, J. London Math. Society 38 (1979) 423-451.
22. P.D. Seymour, On Tutte's extension of the four-colour problem, J. Comb. Theory (B) 31 (1981) 82-94.
23. P.D. Seymour, Colouring series-parallel graphs, Combinatorica 10 (1990) 379-392.
24. F.B. Shepherd, Near-Perfection and Stable Set Polyhedra, Ph.D. Thesis, University of Waterloo (1990).