On the cycle structure of hamiltonian k-regular bipartite graphs of order 4k

arXiv0711.4426MaRDI QIDQ6207640FDOQ6207640

Authors: Janusz Adamus 

Publication date: 28 November 2007

Abstract: It is shown that a hamiltonian $n/2$-regular bipartite graph $G$ of order $2n>8$ contains a cycle of length $2n-2$. Moreover, if such a cycle can be chosen to omit a pair of adjacent vertices, then $G$ is bipancyclic.

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38)

This page was built for publication: On the cycle structure of hamiltonian k-regular bipartite graphs of order 4k

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