A dual of 4-regular graph for<i>G × C<sub>2n</sub></i> (Q4440679)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2019974
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A dual of 4-regular graph for<i>G × C<sub>2n</sub></i> |
scientific article; zbMATH DE number 2019974 |
Statements
A dual of 4-regular graph for<i>G × C<sub>2n</sub></i> (English)
0 references
2003
0 references
Hamiltonian cycle
0 references
Hamiltonian decomposable graphs
0 references
0 references
0.8787004
0 references
0.8766814
0 references
0.87360615
0 references
0.8709425
0 references
0 references
0.86438644
0 references
0.86158144
0 references
0 references
A graph is \(h\)-decomposable if it is decomposable into edge-disjoint Hamiltonian cycles. Motivated by a 1992 conjecture of \textit{P. K. Jha} [Indian J. Pure Appl. Math. 23, 723--729 (1992; Zbl 0783.05080)], the author proves the following result. If \(G=C_{1,2}\oplus C_{3,4}\) is a 4-regular non-bipartite \(h\)-decomposable graph and the dual graphs relative to \(C_{1,2}\) and \(C_{3,4}\) are connected, then \(G\times K_2\) and \(G\times C_{2n}\) are \(h\)-decomposable.
0 references
