A degree sum condition for graphs to be prism hamiltonian

Ozeki, Kenta

doi:10.1016/j.disc.2008.12.028

Cited by 7 publications

(11 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Therefore, one can assert that a graph is prism-hamiltonian if it has a spanning good even cactus. This strategy is in fact the most common approach used to prove the prism-hamiltonicity of many planar and non-planar graph classes; we refer to [19,15,2,16,3,6,7,21] for examples. 1 It is worth noting that in [19,15,16,3,6] a more restrictive approach was adopted, namely to show the existence of a spanning good even cactus with maximum degree at most three, that is, any two cycles of the cactus are disjoint.…”

Section: Theorem 2 ([20]mentioning

confidence: 99%

On the Hamiltonian Property Hierarchy of 3-Connected Planar Graphs

2022

Electron. J. Combin.

View full text Add to dashboard Cite

The prism over a graph $G$ is the Cartesian product of $G$ with the complete graph $K_2$. The graph $G$ is prism-hamiltonian if the prism over $G$ has a Hamilton cycle. A good even cactus is a connected graph in which every block is either an edge or an even cycle and every vertex is contained in at most two blocks. It is known that good even cacti are prism-hamiltonian. Indeed, showing the existence of a spanning good even cactus has become the most common technique in proving prism-hamiltonicity. Špacapan [S. Špacapan. A counterexample to prism-hamiltonicity of 3-connected planar graphs. J. Combin. Theory Ser. B, 146:364--371, 2021] asked whether having a spanning good even cactus is equivalent to having a hamiltonian prism for 3-connected planar graphs. In this article we answer his question in the negative, by showing that there are infinitely many 3-connected planar prism-hamiltonian graphs that have no spanning good even cactus. In addition, we prove the existence of an infinite class of 3-connected planar graphs that have a spanning good even cactus but no spanning good even cactus with maximum degree three.

show abstract

Section: Theorem 2 ([20]mentioning

confidence: 99%

On the Hamiltonian Property Hierarchy of 3-Connected Planar Graphs

2022

Electron. J. Combin.

View full text Add to dashboard Cite

show abstract

“…Therefore, one can assert that a graph is prism-hamiltonian if it has a spanning good even cactus. This strategy has been used in proving prism-hamiltonicity for various planar and non-planar graph classes; we refer to [14,12,2,13,4,5,6,15] for examples. 1 It is worth noting that in [14,12,13,4,5] a more restrictive approach was adopted, namely showing the existence of a spanning good even cactus with maximum degree at most three.…”

Section: Theorem 2 ([16]mentioning

confidence: 99%

“…This strategy has been used in proving prism-hamiltonicity for various planar and non-planar graph classes; we refer to [14,12,2,13,4,5,6,15] for examples. 1 It is worth noting that in [14,12,13,4,5] a more restrictive approach was adopted, namely showing the existence of a spanning good even cactus with maximum degree at most three. This proof technique motivates us to refine the spanning structure hierarchy as follows:…”

Section: Theorem 2 ([16]mentioning

confidence: 99%

On the spanning structure hierarchy of 3-connected planar graphs

2021

Preprint

View full text Add to dashboard Cite

The prism over a graph G is the Cartesian product of G with the complete graph K 2 . G is prism-hamiltonian if the prism over G has a Hamilton cycle. A good even cactus is a connected graph in which every block is either an edge or an even cycle, and every vertex is contained in at most two blocks. It is known that good even cacti are prism-hamiltonian. Indeed, showing the existence of a spanning good even cactus has become one of the most common techniques in proving prism-hamiltonicity. Špacapan asked whether having a spanning good even cactus is equivalent to having a hamiltonian prism for 3-connected planar graphs. In this article we give a negative answer to this question by showing that there are infinitely many 3-connected planar prism-hamiltonian graphs that have no spanning good even cactus. We also prove the existence of an infinite class of 3-connected planar graphs that have a spanning good even cactus but no spanning good even cactus with maximum degree three.

show abstract

“…Ore showed that σ 2 (G) ≥ n implies that G is hamiltonian, and Jackson and Wormald showed that σ 3 (G) ≥ n implies that G has a 2-walk (provided that G is connected). This was strenghtened by Ozeki in [14] who showed that σ 3 (G) ≥ n implies that G is prism-hamiltonian.…”

Section: Introductionmentioning

confidence: 96%