Graph imperfection II

Journal of Combinatorial Theory. Series B

Volumn 83, Issue 1, 2001, Pages 79-101

  Gerke, Stefanie ^a   McDiarmid, Colin ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

Cochromatic number; Imperfection ratio; Perfect graphs; Radio channel assignment; Random graphs

Indexed keywords

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

References (25)

1. Explicit Ramsey graphs and orthonormal labelings
2. A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
3. The independence ratio of regular graphs
4. The chromatic number of random graphs
5. On the covering number of combinatorial structures
6. Some remarks on chromatic graphs
7. On the independence numbers of random graphs
8. On the independence numbers of random regular graphs
9. Graph imperfection
10. The choice number of sparse graphs
11. 2/log t
12. Normal hypergraphs and the perfect graph conjecture
13. The chromatic number of random graphs
14. On the hardness of approximating minimization problems
15. Concentration
16. On the chromatic number of random graphs
17. Graph imperfection and channel assignment
18. On a packing and covering problem