K5-subdivisions in graphs

Combinatorics Probability and Computing

Volumn 5, Issue 2, 1996, Pages 179-189

  Thomassen, Garsten ^a  

^a TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 17644400527     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/s0963548300001954     Document Type: Article

References (12)

1. Bondy, J. A. and Lovász, L. (1981) Cycles through specified vertices of a graph, Combinatorica 1 114-140.
2. Bollobás, B. (1978) Extremal Graph Theory, Academic Press.
3. Bollobás, B. and Thomason, A. G. Proof of a conjecture of Mader, Erdös and Hajnal on topological complete subgraphs, Combinatorica, to appear.
4. Dirac, G. A. (1964) Homomorphism theorems for graphs, Math. Ann. 153 69-80.
5. Komlós, J. and Szemerédi, E. Topological cliques in graphs, Combinatorics, Probability and Computing, to appear.
6. Lovász, L. (1974) Problem 5, Period. Math. Hungar. 4 82.
7. Perfect, H. (1968) Applications of Menger's theorem, J. Math. Analysis Appl. 22 96-111.
8. Seymour, P. D. (1980) Disjoint paths in graphs, Discrete Math. 29 292-309.
9. Thomassen, C. (1974) Some homeomorphism properties of graphs, Math. Nachr. 64 119-133.
10. Thomassen, C. (1980) 2-linked graphs, Euro. J. Combinatorics 1 371-378.
11. Thomassen, C. (1984) Plane representations of graphs, in Progress in Graph Theory, J. A. Bondy and U. S. R. Murty, eds., Academic Press, pp. 43-69.
12. Thomassen, C. (1988) Paths circuits and subdivisions, in Selected Topics in Graph Theory, L. W. Beineke and R. J. Wilson, eds., Academic Press, pp. 97-131.