Hostname: page-component-8448b6f56d-t5pn6 Total loading time: 0 Render date: 2024-04-24T01:05:43.175Z Has data issue: false hasContentIssue false
  • English
  • Français

Randomly k-axial graphs

Published online by Cambridge University Press:  17 April 2009

David Burns ,
Gary Chartrand ,
S.F. Kapoor  and
Farrokh Saba
David Burns
Affiliation:
Department of Mathematics, School of General Education, Ferris State College, Big Rapids, Michigan 49307, USA
Gary Chartrand
Affiliation:
Department of Mathematics, Western Michigan University, Kalamazoo, Michigan 49008, USA.
S.F. Kapoor
Affiliation:
Department of Mathematics, Western Michigan University, Kalamazoo, Michigan 49008, USA.
Farrokh Saba
Affiliation:
Department of Mathematics, Western Michigan University, Kalamazoo, Michigan 49008, USA.
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.

A class of graphs called randomly k-axial graphs is introduced, which generalizes randomly traceable graphs. The problems of determining which bipartite graphs and which complete n-partite graphs are randomly k-axial are studied.

Type
Research Article
Information
Bulletin of the Australian Mathematical Society , Volume 23 , Issue 1 , February 1981 , pp. 143 - 156
Copyright
Copyright © Australian Mathematical Society 1981

References

[1]Chartrand, Gary and Kronk, Hudson V., “Randomly traceable graphs”, SIAM J. Appl. Math. 16 (1968), 696–700.CrossRefGoogle Scholar
[2]Thomassen, Carsten, “Graphs in which every path is contained in a Hamilton path”, J. reine angew. Math. 268/269 (1974), 271–282.Google Scholar