Graphs with forbidden subgraphs

Journal of Combinatorial Theory, Series B

Volumn 10, Issue 1, 1971, Pages 12-41

  Chartrand, Gary ^a   Geller, Dennis ^b   Hedetniemi, Stephen ^c  

^a WESTERN MICHIGAN UNIVERSITY   (United States)

^b UNIVERSITY OF MICHIGAN   (United States)

^c UNIVERSITY OF IOWA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33847256626     PISSN: 00958956     EISSN: 10960902     Source Type: Journal    
DOI: 10.1016/0095-8956(71)90065-7     Document Type: Article

References (33)

1. Graphs and Their Chromatic Numbers
2. A Criterion for the Planarity of the Total Graph
3. Decompositions of Complete Graphs into Forests
4. On the Decomposition of Complete Graphs into Planar and Other Subgraphs
5. Topological Aspects of Complete Graphs
6. The Coarseness of a Graph
7. Inequalities involving the Genus of a Graph and Its Thicknesses
8. The Thickness of the Complete Graph
9. On the Thickness of the Complete Bipartite Graph
10. A Generalization of the Chromatic Number
11. Planar Permutation Graphs
12. Minimal Coverings of Pairs of Triples
13. A Coarseness Conjecture of Erdo¨s
14. The Coarseness of the Complete Graph
15. U¨ber einen graphentheoretischen Basisbegriff und seine Anwendung auf Fa¨rbungsprobleme
16. A Dual Form of Kuratowski's Theorem
17. Homomorphisms of Graphs and Automata
18. On the Geographical Problem of the Four Colors
19. Sur le Proble´me des Courbes gauches en Topologie
20. Decompositions of Finite Graphs into Forests
21. Some Properties of Interchange Graphs
22. A Class of Planar Graphs Containing Hamilton Circuits
23. On the Problem of Decomposing a Graph inton-Connected Factors
24. The Thickness of a Graph
25. Bemerkungen zum Vierfarbenproblem
26. U¨ber eine Erweiterung eines Satzes von Kuratowski
27. Bemerkungen zu Hadwigers Vermutung
28. Congruent Graphs and the Connectivity of Graphs