Graphs with forbidden subgraphs
- 1 February 1971
- journal article
- Published by Elsevier BV in Journal of Combinatorial Theory, Series B
- Vol. 10 (1), 12-41
- https://doi.org/10.1016/0095-8956(71)90065-7
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- The Coarseness of the Complete GraphCanadian Journal of Mathematics, 1968
- A coarseness conjecture of ErdösJournal of Combinatorial Theory, 1967
- A Dual form of Kuratowski's TheoremCanadian Mathematical Bulletin, 1965
- The Thickness of the Complete GraphCanadian Journal of Mathematics, 1965
- Inequalities involving the genus of a graph and its thicknessesProceedings of the Glasgow Mathematical Association, 1965
- Decomposition of Finite Graphs Into ForestsJournal of the London Mathematical Society, 1964
- On the Problem of Decomposing a Graph into n Connected FactorsJournal of the London Mathematical Society, 1961
- Minimal coverings of pairs by triplesPacific Journal of Mathematics, 1958
- Sur le problème des courbes gauches en TopologieFundamenta Mathematicae, 1930
- On the Geographical Problem of the Four ColoursAmerican Journal of Mathematics, 1879