On square-Hamiltonian graphs

dc.contributor.author	Protasova, K.D.
dc.date.accessioned	2019-06-19T17:32:22Z
dc.date.available	2019-06-19T17:32:22Z
dc.date.issued	2005
dc.identifier.citation	On square-Hamiltonian graphs / K.D. Protasova // Algebra and Discrete Mathematics. — 2005. — Vol. 4, № 3. — С. 56–59. — Бібліогр.: 7 назв. — англ.	uk_UA
dc.identifier.issn	1726-3255
dc.identifier.other	2000 Mathematics Subject Classification: 05C45.
dc.identifier.uri	http://dspace.nbuv.gov.ua/handle/123456789/157198
dc.description.abstract	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.	uk_UA
dc.language.iso	en	uk_UA
dc.publisher	Інститут прикладної математики і механіки НАН України	uk_UA
dc.relation.ispartof	Algebra and Discrete Mathematics
dc.title	On square-Hamiltonian graphs	uk_UA
dc.type	Article	uk_UA
dc.status	published earlier	uk_UA