2011
DOI: 10.37236/690
|View full text |Cite
|
Sign up to set email alerts
|

Hamiltonian Cycles in the Square of a Graph

Abstract: We show that under certain conditions the square of the graph obtained by identifying a vertex in two graphs with hamiltonian square is also hamiltonian. Using this result, we prove necessary and sufficient conditions for hamiltonicity of the square of a connected graph such that every vertex of degree at least three in a block graph corresponds to a cut vertex and any two these vertices are at distance at least four.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
20
0

Year Published

2013
2013
2021
2021

Publication Types

Select...
7

Relationship

2
5

Authors

Journals

citations
Cited by 9 publications
(20 citation statements)
references
References 4 publications
0
20
0
Order By: Relevance
“…In subsequent papers we shall use some of the theorems of this paper to describe (among other results) the most general structure a graph may have such that its square is hamiltonian or hamiltonian connected, respectivelly. This will also solve a problem raised in [4] in the affirmative and proves a conjecture raised in [19]; we shall also present a partial solution of a conjecture stated in [5].…”
Section: Final Remarksmentioning
confidence: 59%
“…In subsequent papers we shall use some of the theorems of this paper to describe (among other results) the most general structure a graph may have such that its square is hamiltonian or hamiltonian connected, respectivelly. This will also solve a problem raised in [4] in the affirmative and proves a conjecture raised in [19]; we shall also present a partial solution of a conjecture stated in [5].…”
Section: Final Remarksmentioning
confidence: 59%
“…Then G ′ is a connected graph without non-trivial bridges and without bad leaves and we prove by induction on k that (G ′ ) 2 contains a [2,4]-factor F ′ such that 1) d F ′ (x) = 2 for any vertex x that is not a cut vertex of G;…”
Section: Lemma 9 (Useful Lemma) Let G Be a Connected Graph Without Nmentioning
confidence: 99%
“…If G is a connected graph such that every induced S(K 1,3 ) has at least three edges in a block of degree at most 2, then G 2 is hamiltonian. Theorem 2 was generalized by Ekstein et al in [2] for [2, 2s]-factors.…”
Section: Theorem 2 [4]mentioning
confidence: 99%
See 2 more Smart Citations