Critical chromatic number and the complexity of perfect packings in graphs

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2006, Pages 851-859

  Kühn, Daniela ^a   Osthus, Deryk ^a  

^a UNIVERSITY OF BIRMINGHAM   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; PROBLEM SOLVING;

CRITICAL CHROMATIC NUMBER; H -PACKING; OPTIMAL COLOURINGS; PERFECT PACKINGS;

GRAPH THEORY;

EID: 33244492180     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1109557.1109651     Document Type: Conference Paper

References (22)

1. N. Alon, R.A. Duke, H. Lefmann, V. Rödl and R. Yuster, The algorithmic aspects of the Regularity lemma, J. Algorithms 16 (1994), 80-109.
2. N. Alon and J. Spencer, The Probabilistic Method (2nd edition), Wiley-Interscience 2000.
3. N. Alon and R. Yuster, H-factors in dense graphs, J. Combin. Theory B 66 (1996), 269-282.
4. B. Bollobás, Modern Graph Theory, Graduate Texts in Mathematics 184, Springer-Verlag 1998.
5. B.S. Baker, Approximation algorithms for NP-complete problems on planar graphs, Proc. 24th Ann. IEEE Symp. on Foundations of Computer Science (1983), 265-273.
6. F. Berman, D. Johnson, T. Leighton, P.W. Shor and L. Snyder, Generalized planar matching, J. Algorithms 11 (1990), 153-184.
7. R. Diestel, Graph Theory, Graduate Texts in Mathematics 173, Springer-Verlag 1997.
8. P. Hell and D.G. Kirkpatrick, Scheduling, matching and colouring, Colloquia Math. Soc. Bolyai 25 (1978), 273-279.
9. P. Hell and D.G. Kirkpatrick, On the complexity of general graph factor problems, SIAM J. Computing 12 (1983), 601-609.
10. C. Hurkens and A. Schrijver, On the size of systems of sets every t of which have an SDR, with an application to the worst-case ratio of heuristics for packing problems, SIAM J. Disc. Math. 2 (1989), 68-72.
11. V. Kann, Maximum bounded H-matching is MAX SNP-complete, Information Processing Letters 49 (1994), 309-318.
12. --factors in a graph, J. Graph Theory 39 (2002), 111-128.
13. J. Komlós, The Blow-up lemma, Comb. Probab. Comput. 8 (1999), 161-176.
14. J. Komlós, Tiling Turán theorems, Combinatorica 20 (2000), 203-218.
15. J. Komlós, G. N. Sárközy and E. Szemerédi, Blow-up lemma, Combinatorica 17 (1997), 109-123.
16. J. Komlós, G. N. Sárközy and E. Szemerédi, An algorithmic version of the blow-up lemma, Random Struct. Alg. 12 (1998), 297-312.
17. J. Komlós, G. N. Sárközy and E. Szemerédi, Proof of the Alon-Yuster conjecture, Discrete Math. 235 (2001), 255-269.
18. J. Komlós and M. Simonovits, Szemerédi's Regularity Lemma and its applications in graph theory, Bolyai Society Mathematical Studies 2, Combinatorics, Paul Erdos is Eighty (Vol. 2) (D. Miklós, V. T. Sós and T. Szönyi eds.), Budapest (1996), 295-352.
19. -packings in graphs, submitted.
20. D. Kühn and D. Osthus, The minimum degree threshold for perfect graph packings, in preparation.
21. D. Kühn, D. Osthus and A. Taraz, Large planar subgraphs in dense graphs, J. Combin. Theory B, to appear.
22. A. Shokoufandeh and Y. Zhao, Proof of a conjecture of Komlós, Random Struct. Alg. 23 (2003) 180-205.