On open Hamiltonian walks in graphs
Pavel Vacek (1991)
Archivum Mathematicum
Similarity:
Displaying similar documents to “On k-Path Pancyclic Graphs”
On open Hamiltonian walks in graphs
On the line graph of the square and the square of the line graph of a connected graph
Ladislav Nebeský (1973)
Časopis pro pěstování matematiky
Similarity:
Maximal nontraceable graphs with toughness less than one.
Bullock, Frank, Frick, Marietjie, Singleton, Joy, van Aardt, Susan, Mynhardt, Kieka (C.M.) (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On -path hamiltonian graphs and line-graphs
Tudor Zamfirescu (1971)
Rendiconti del Seminario Matematico della Università di Padova
Similarity:
Lower bound for the size of maximal nontraceable graphs.
Frick, Marietjie, Singleton, Joy (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Bounds of lengths of open Hamiltonian walks
Pavel Vacek (1992)
Archivum Mathematicum
Similarity:
If is a graph, an open Hamiltonian walk is any open sequence of edges of minimal length which includes every vertex of . In this paper bounds of lengths of open Hamiltonian walks are studied.
Hamiltonicity of -traceable graphs.
Bullock, Frank, Dankelmann, Peter, Frick, Marietjie, Henning, Michael A., Oellermann, Ortrud R., van Aardt, Susan (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity: