Graph imperfection

Journal of Combinatorial Theory. Series B

Volumn 83, Issue 1, 2001, Pages 58-78

  Gerke, Stefanie ^a   McDiarmid, Colin ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

Imperfection ratio; Perfect graphs; Ratio channel assignment; Stable set polytope; Weighted colouring

Indexed keywords

EID: 0035190247     PISSN: 00958956     EISSN: None     Source Type: Journal    
DOI: 10.1006/jctb.2001.2042     Document Type: Article

References (36)

1. Choosability and fractional chromatic numbers
2. Polytope des indépendants dans un graph série-paralléle
3. On certain polytopes associated with graphs
4. Unit disk graphs
5. Choosability in graphs
6. Minimum independence graphs with maximum degree four
7. Some lower bounds for a class of frequency assignment problems
8. Graph imperfection II
9. On coloring unit disk graphs
10. Ein Dreifarbensatz für dreikreisfreie Netze auf der Kugel
11. Frequency assignment
12. Multicolouring of the induced subgraphs of the triangular lattice
13. (2 + ∈)-colouring of planar graphs with large odd girth
14. On wireless spectrum estimation and generalized graph colouring
15. The fractional chromatic number of Mycielski graphs
16. On the width-length inequality
17. Normal hypergraphs and the perfect graph conjecture
18. A characterization of perfect graphs
19. On the chromatic number of disk graphs
20. Graph imperfection and channel assignment
21. Channel assignment and weighted colouring
22. Sur le coloriage des graphs
23. Static frequency assignment in cellular networks
24. Improving heuristics for the frequency assignment problem
25. Grötzsch's 3-color theorem
26. Line perfect graphs
27. The strong perfect graph conjecture for planar graphs
28. Vertex colouring with given colours