A dual of 4-regular graph forG × C2n

DOI10.1080/09720529.2003.10697965MaRDI QIDQ4440679zbMATH OpenOpenAlexFDO

Authors H. Kheddouci

Publication date 2003

Published in Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/09720529.2003.10697965

zbMATH Keywords

Hamiltonian cycleHamiltonian decomposable graphs

Mathematics Subject Classification ID

Paths and cycles (05C38)

Review text

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.

Recommendations

• Dual graph polynomials and a \(4\)-face formula
• Orthogonal double covers of 4-regular circulant graphs
• Cyclic orthogonal double covers of 4-regular circulant graphs
• Regular maps of graphs of order 4p
• 4-cordiality of some regular graphs and the complete 4-partite graph
• The A₄-structure of a graph
• Regular 4‐critical graphs of even degree
• PLANAR CAYLEY GRAPHS WITH REGULAR DUAL
• P4-decompositions of regular graphs
• scientific article; zbMATH DE number 2058013

Cites work

• Edge exchanges in Hamiltonian decompositions of Kronecker-product graphs

Cited in

(1)

• On a problem of a. kotzig concerning factorizations of 4‐regular graphs

This page was built for publication: A dual of 4-regular graph forG × C_2n

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4440679)