Remarks on Hamiltonian properties of squares of graphs
Günter Schaar (1989)
Archivum Mathematicum
Similarity:
Günter Schaar (1989)
Archivum Mathematicum
Similarity:
Elena Wisztová (1980)
Časopis pro pěstování matematiky
Similarity:
Elena Wisztová (1995)
Mathematica Bohemica
Similarity:
In this paper the following results are proved: 1. Let be a path with vertices, where and . Let be a matching in . Then is hamiltonian-connected. 2. Let be a connected graph of order , and let be a matching in . Then is hamiltonian-connected.
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...