We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
An abstract is not available for this content so a preview has been provided. As you have access to this content, a full PDF is available via the ‘Save PDF’ action button.
[1]Eggleton, R.B. and Skilton, D.K., “Chain decompositions of graphs, 1: abstract graphs”, Proceedings of the First Southeast Asion Colloquium on Graph Theory (National University of Singapore, Singapore, to appear).Google Scholar
[2]
[2]Eggleton, R.B. and Skilton, D.K., “Chain decompositions of graphs, 2: surface embeddings”, Proceedings of the First Southeast Asian Colloquium on Graph Theory (National University of Singapore, Singapore, to appear).Google Scholar
[3]
[3]Erdös, P., Grünwald, T. und Vázsonyi, E., “Über Euler-Linien unendlicher Graphen”, J. Math. Phys.17 (1938), 59–75.CrossRefGoogle Scholar
[4]
[4]Euler, L., “Solutio problematis ad geometriam situs pertinentis”, Comment. Acad. Sci. Imperialis Petropolitanae8 (1736), 128–140.Google Scholar
[5]
[5]Listing, J.B., “Verstudien zur Topologie”, Göttinger Studien1 (1847), 811–875.Google Scholar
[6]
[6]Nash-Williams, C.St.J.A., “Decomposition of graphs into closed and endless chains”, Proc. London Math. Soc.10 (1960), 221–238.CrossRefGoogle Scholar
[7]
[7]Nash-Williams, C.St.J.A., “Decomposition of graphs into two-way infinite paths”, Canad. J. Math.15 (1963), 479–485.CrossRefGoogle Scholar
[8]
[8]Ore, O., Theory of graphs (American Mathematical Society Colloquium Publications, 38. American Mathematical Society, Providence, Rhode Island, 1962).Google Scholar
[9]
[9]Rothschild, B., “The decomposition of graphs into a finite number of paths”, Canad. J. Math.17 (1965), 168–479.CrossRefGoogle Scholar