On square-Hamiltonian graphs
A finite connected graph G is called squareHamiltonian if G²
 is Hamiltonian. We prove that any join of
 the family of Hamiltonian graphs by tree is square-Hamiltonian.
 Applying this statement we show that the line graph and any
 round-about reconstruction of an arbi...
Saved in:
| Published in: | Algebra and Discrete Mathematics |
|---|---|
| Date: | 2005 |
| Main Author: | |
| Format: | Article |
| Language: | English |
| Published: |
Інститут прикладної математики і механіки НАН України
2005
|
| Online Access: | https://nasplib.isofts.kiev.ua/handle/123456789/157198 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | Digital Library of Periodicals of National Academy of Sciences of Ukraine |
| Cite this: | On square-Hamiltonian graphs / K.D. Protasova // Algebra and Discrete Mathematics. — 2005. — Vol. 4, № 3. — С. 56–59. — Бібліогр.: 7 назв. — англ. |
Institution
Digital Library of Periodicals of National Academy of Sciences of Ukraine| _version_ | 1862614059101192192 |
|---|---|
| author | Protasova, K.D. |
| author_facet | Protasova, K.D. |
| citation_txt | On square-Hamiltonian graphs / K.D. Protasova // Algebra and Discrete Mathematics. — 2005. — Vol. 4, № 3. — С. 56–59. — Бібліогр.: 7 назв. — англ. |
| collection | DSpace DC |
| container_title | Algebra and Discrete Mathematics |
| description | A finite connected graph G is called squareHamiltonian if G²
is Hamiltonian. We prove that any join of
the family of Hamiltonian graphs by tree is square-Hamiltonian.
Applying this statement we show that the line graph and any
round-about reconstruction of an arbitrary finite connected graph
is square-Hamiltonian.
|
| first_indexed | 2025-11-29T09:37:43Z |
| format | Article |
| fulltext | |
| id | nasplib_isofts_kiev_ua-123456789-157198 |
| institution | Digital Library of Periodicals of National Academy of Sciences of Ukraine |
| issn | 1726-3255 |
| language | English |
| last_indexed | 2025-11-29T09:37:43Z |
| publishDate | 2005 |
| publisher | Інститут прикладної математики і механіки НАН України |
| record_format | dspace |
| spelling | Protasova, K.D. 2019-06-19T17:32:22Z 2019-06-19T17:32:22Z 2005 On square-Hamiltonian graphs / K.D. Protasova // Algebra and Discrete Mathematics. — 2005. — Vol. 4, № 3. — С. 56–59. — Бібліогр.: 7 назв. — англ. 1726-3255 2000 Mathematics Subject Classification: 05C45. https://nasplib.isofts.kiev.ua/handle/123456789/157198 A finite connected graph G is called squareHamiltonian if G²
 is Hamiltonian. We prove that any join of
 the family of Hamiltonian graphs by tree is square-Hamiltonian.
 Applying this statement we show that the line graph and any
 round-about reconstruction of an arbitrary finite connected graph
 is square-Hamiltonian. en Інститут прикладної математики і механіки НАН України Algebra and Discrete Mathematics On square-Hamiltonian graphs Article published earlier |
| spellingShingle | On square-Hamiltonian graphs Protasova, K.D. |
| title | On square-Hamiltonian graphs |
| title_full | On square-Hamiltonian graphs |
| title_fullStr | On square-Hamiltonian graphs |
| title_full_unstemmed | On square-Hamiltonian graphs |
| title_short | On square-Hamiltonian graphs |
| title_sort | on square-hamiltonian graphs |
| url | https://nasplib.isofts.kiev.ua/handle/123456789/157198 |
| work_keys_str_mv | AT protasovakd onsquarehamiltoniangraphs |