Lower bound for the size of maximal nontraceable graphs.
Frick, Marietjie, Singleton, Joy (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “On open Hamiltonian walks in graphs”
Lower bound for the size of maximal nontraceable graphs.
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:
On k-Path Pancyclic Graphs
Zhenming Bi, Ping Zhang (2015)
Discussiones Mathematicae Graph Theory
Similarity:
For integers k and n with 2 ≤ k ≤ n − 1, a graph G of order n is k-path pancyclic if every path P of order k in G lies on a cycle of every length from k + 1 to n. Thus a 2-path pancyclic graph is edge-pancyclic. In this paper, we present sufficient conditions for graphs to be k-path pancyclic. For a graph G of order n ≥ 3, we establish sharp lower bounds in terms of n and k for (a) the minimum degree of G, (b) the minimum degree-sum of nonadjacent vertices of G and (c) the size of G...
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:
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.