Hostname: page-component-cd9895bd7-mkpzs Total loading time: 0 Render date: 2024-12-23T02:38:08.791Z Has data issue: false hasContentIssue false
  • English
  • Français

Completely semi-stable trees

Published online by Cambridge University Press:  17 April 2009

D.A. Holton
D.A. Holton
Affiliation:
Department of Mathematics, University of Melbourne, Parkville, Victoria.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Completely semi-stable trees are characterised by the complete absence of three types of subtrees.

Type
Research Article
Information
Bulletin of the Australian Mathematical Society , Volume 9 , Issue 3 , December 1973 , pp. 355 - 362
Copyright
Copyright © Australian Mathematical Society 1973

References

[1]Harary, Frank, Graph theory (Addison-Wesley, Reading, Massachussets; London; Ontario; 1969).CrossRefGoogle Scholar
[2]Holton, D.A., “Stable trees”, Proc. First Austral. Conf. Combinatorial Math., Newcastle, 1972, 15–21 (TUNRA, Newcastle, 1972).Google Scholar
[3]Holton, D.A., “Two applications of semi-stability”, Discrete Math. 4 (1973), 151–158.CrossRefGoogle Scholar
[4]Holton, D.A., “Some results on semi-stable graphs”, Proc. British Combinatorial Soc. (Aberystwyth, 1973).Google Scholar
[5]Holton, D.A., “A report on stable graphs”, J. Austral. Math. Soc. 15 (1973), 163–171.CrossRefGoogle Scholar
[6]Holton, D.A. and Grant, Douglas D., “Regular graphs and stability”, (submitted).Google Scholar
[7]Wielandt, Helmut, Finite, permutation groups (translated by Bercov, R.; Academic Press, New York, London, 1964).Google Scholar