Geodesic
Hamiltonian cycles in the square of a graph
The electronic journal of combinatorics, Tome 18 (2011) no. 1

Voir la notice de l'article provenant de la source The Electronic Journal of Combinatorics website

Zbl arXiv
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.
DOI : 10.37236/690
Classification : 05C45, 05C38, 05C40
Mots-clés : Hamiltonian cycle, connection of graphs, block graph, square, star 
Jan Ekstein. Hamiltonian cycles in the square of a graph. The electronic journal of combinatorics, Tome 18 (2011) no. 1. doi: 10.37236/690
@article{10_37236_690,
     author = {Jan Ekstein},
     title = {Hamiltonian cycles in the square of a graph},
     journal = {The electronic journal of combinatorics},
     year = {2011},
     volume = {18},
     number = {1},
     doi = {10.37236/690},
     zbl = {1229.05196},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/690/}
}
TY  - JOUR
AU  - Jan Ekstein
TI  - Hamiltonian cycles in the square of a graph
JO  - The electronic journal of combinatorics
PY  - 2011
VL  - 18
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/690/
DO  - 10.37236/690
ID  - 10_37236_690
ER  - 
%0 Journal Article
%A Jan Ekstein
%T Hamiltonian cycles in the square of a graph
%J The electronic journal of combinatorics
%D 2011
%V 18
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/690/
%R 10.37236/690
%F 10_37236_690

Cité par Sources :