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

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

2007-11-28

arxiv.org/abs/0711.4426v3

Mathematics

Combinatorics

3 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

On the cycle structure of hamiltonian k-regular bipartite graphs of order 4k does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the cycle structure of hamiltonian k-regular bipartite graphs of order 4k, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the cycle structure of hamiltonian k-regular bipartite graphs of order 4k will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-248845