Fragmentability of graphs

Journal of Combinatorial Theory. Series B

Volumn 82, Issue 1, 2001, Pages 30-37

  Edwards, Keith ^a   Farr, Graham ^b  

^a UNIVERSITY OF DUNDEE   (United Kingdom)

^b MONASH UNIVERSITY   (Australia)

Author keywords

Fragmentability; planarisation; component

Indexed keywords

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

References (7)

1. Ajtai M., Komlós J., Szemerédi E. A note on Ramsey numbers. J. Combin. Theory Ser. A. 29:1980;354-360.
2. Alon N., Seymour P., Thomas R. A separator theorem for graphs with an excluded minor and its applications. Proc. 22nd Annual ACM Symposium on Theory of Computing. 1990;Assoc. Comput. Mach. New York. p. 293-299.
3. Bollobás B. Extremal Graph Theory. 1978;Academic Press, New York.
4. Edwards K. J., McDiarmid C. J. H. New upper bounds on harmonious colorings. J. Graph Theory. 18:1994;257-267.
5. Erdos P., Sachs H. Reguläre Graphen gegebener Taillenweite mit minimaler Knotenzahl. Wiss. Z. Univ. Halle Martin-Luther Univ. Halle-Wittenberg Math.-Natur. Reihe. 12:1963;251-257.
6. Gilbert J. R., Hutchinson J. P., Tarjan R. E. A separator theorem for graphs of bounded genus. J. Algorithms. 5:1984;391-407.
7. Lipton R. J., Tarjan R. E. A separator theorem for planar graphs. SIAM J. Appl. Math. 36:1979;177-189.