No CrossRef data available.
Article contents
Chain decompositions of graphs
Published online by Cambridge University Press: 17 April 2009
Abstract
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.
- Type
- Abstracts of Australasian PhD theses
- Information
- Copyright
- Copyright © Australian Mathematical Society 1985
References
[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]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]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]Euler, L., “Solutio problematis ad geometriam situs pertinentis”, Comment. Acad. Sci. Imperialis Petropolitanae 8 (1736), 128–140.Google Scholar
[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]Nash-Williams, C.St.J.A., “Decomposition of graphs into two-way infinite paths”, Canad. J. Math. 15 (1963), 479–485.CrossRefGoogle Scholar
[8]Ore, O., Theory of graphs (American Mathematical Society Colloquium Publications, 38. American Mathematical Society, Providence, Rhode Island, 1962).Google Scholar
[9]Rothschild, B., “The decomposition of graphs into a finite number of paths”, Canad. J. Math. 17 (1965), 168–479.CrossRefGoogle Scholar
You have
Access