On open Hamiltonian walks in graphs
Pavel Vacek (1991)
Archivum Mathematicum
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.
Displaying similar documents to “Bounds of lengths of open Hamiltonian walks”
On open Hamiltonian walks in graphs
On -path hamiltonian graphs and line-graphs
Tudor Zamfirescu (1971)
Rendiconti del Seminario Matematico della Università di Padova
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...
Minimum functors on categories of Neumann trees
Rotraut Goebel (1981)
Časopis pro pěstování matematiky
Similarity: