Randomly k-axial graphs
David Burns, Gary Chartrand, S.F. Kapoor, Farrokh Saba · Bulletin of the Australian Mathematical Society · 1981
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.