Graph decomposition with applications to subdivisions and path systems modulo k. (English) Zbl 0515.05052
Keywords:
minimum degree; subdivisions of complete bipartite graphs; chromatic number; path systems with prescribed ends; three set decompositionReferences:
| [1] | Bollobás, K. Bull. London Math. Soc. 9 pp 97– (1977) |
| [2] | Bollobás, Discrete Math. 20 pp 83– (1977) |
| [3] | Extremal Graph Theory. Academic, London (1978). |
| [4] | Dirac, Math. Nachr. 22 pp 61– (1960) |
| [5] | Some recent progress in extremal graph theory. In Proceedings, Sixth Southeastern Conference on Combinatories, Graph Theory, and Computing, Congressus Numeratium XIV. Ultilitas, Winnipeg (1975), pp. 3–14. |
| [6] | Halin, Math. Ann. 172 pp 46– (1967) |
| [7] | Jung, Math. Ann. 187 pp 95– (1970) |
| [8] | Larman, Proc. London Math. Soc. 20 pp 144– (1970) |
| [9] | Mader, Math. Ann. 174 pp 265– (1967) |
| [10] | Mader, Math. Nachr. 53 pp 145– (1972) |
| [11] | Mader, Abh. Math. Sem. Hamburg Univ. 37 pp 86– (1972) |
| [12] | Thomassen, J. Graph Theory. |
| [13] | Thomassen, J. Combinatorial Theory Ser. B. 31 pp 199– (1981) |
| [14] | Problem 10. In Recent Advances in Graph Theory. and ák, Eds. Academia, Prague (1975), p. 544. |
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. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
