×

zbMATH — the first resource for mathematics

Graphs with forbidden subgraphs. (English) Zbl 0223.05101

MSC:
05C10 Planar graphs; geometric and topological aspects of graph theory
05C15 Coloring of graphs and hypergraphs
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Behzad, M., Graphs and their chromatic numbers, () · Zbl 0217.30904
[2] Behzad, M., A criterion for the planarity of the total graph, (), 679-681 · Zbl 0158.20703
[3] Beineke, L.W., Decompositions of complete graphs into forests, Magyar tud. akad. mat. kutato´int. ko¨zl., 9, 589-594, (1964) · Zbl 0137.18104
[4] Beineke, L.W., On the decomposition of complete graphs into planar and other subgraphs, () · Zbl 0207.22901
[5] Beineke, L.W., Topological aspects of complete graphs, (), 19-26 · Zbl 0157.31304
[6] Beineke, L.W.; Chartrand, G., The coarseness of a graph, Compositio math., 19, 290-298, (1969) · Zbl 0176.22302
[7] Beineke, L.W.; Harary, F., Inequalities involving the genus of a graph and its thicknesses, Glasgow math. J., 7, 19-21, (1965) · Zbl 0135.42103
[8] Beineke, L.W.; Harary, F., The thickness of the complete graph, Canad. J. math., 17, 618-620, (1965) · Zbl 0123.39903
[9] Beineke, L.W.; Harary, F.; Moon, J.W., On the thickness of the complete bipartite graph, (), 1-5 · Zbl 0121.18402
[10] Berge, C., ()
[11] Chartrand, G.; Geller, D.; Hedetniemi, S., A generalization of the chromatic number, (), 265-271 · Zbl 0173.26204
[12] Chartrand, G.; Harary, F., Planar permutation graphs, Ann. inst. H. poincare´sect. B, 3, 433-438, (1967) · Zbl 0162.27605
[13] Fort, M.K.; Hedlund, G.A., Minimal coverings of pairs of triples, Pacific J. math., 8, 709-719, (1958) · Zbl 0084.01401
[14] Guy, R.K., A coarseness conjecture of erdo¨s, J. combinatorial theory, 3, 38-42, (1967) · Zbl 0149.41501
[15] Guy, R.K., (), Research Paper No. 12
[16] Guy, R.K.; Beineke, L.W., The coarseness of the complete graph, Canad. J. math., 20, 888-894, (1968) · Zbl 0159.25402
[17] Halin, R., U¨ber einen graphentheoretischen basisbegriff und seine anwendung auf fa¨rbungsprobleme, ()
[18] Harary, F., ()
[19] Harary, F.; Tutte, W.T., A dual form of Kuratowski’s theorem, Canad. math. bull., 8, 17-20, (1965) · Zbl 0135.42003
[20] Hedetniemi, S., Homomorphisms of graphs and automata, () · Zbl 0297.05120
[21] Kempe, A.B., On the geographical problem of the four colors, Amer. J. math., 2, 193-200, (1879)
[22] Kuratowski, C., Sur le proble´me des courbes gauches en topologie, Fund. math., 15, 271-283, (1930) · JFM 56.1141.03
[23] Nash-Williams, C., Decompositions of finite graphs into forests, J. London math. soc., 39, 12, (1964) · Zbl 0119.38805
[24] Ore, O., (), (Colloquium Publ. 38)
[25] Ore, O., ()
[26] Sedla´cˇek, J., Some properties of interchange graphs, (), 145-150
[27] Tang, D.T., A class of planar graphs containing Hamilton circuits, IBM res. note NC503, (1965)
[28] Tutte, W.T., On the problem of decomposing a graph inton-connected factors, J. London math. soc., 36, 221-230, (1961) · Zbl 0096.38001
[29] Tutte, W.T., The thickness of a graph, Indagationes math., 25, 567-577, (1963) · Zbl 0123.17002
[30] Wagner, K., Bemerkungen zum vierfarbenproblem, Jber. Deutsch. math.-verein, 46, 26-32, (1936) · Zbl 0014.18102
[31] Wagner, K., U¨ber eine erweiterung eines satzes von Kuratowski, Deut. math., 2, 280-285, (1937) · Zbl 0016.37602
[32] Wagner, K., Bemerkungen zu hadwigers vermutung, Math. ann., 141, 433-451, (1960) · Zbl 0096.17904
[33] Whitney, H., Congruent graphs and the connectivity of graphs, Amer. J. math., 54, 150-168, (1932) · JFM 58.0609.01
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.