A condition for a Hamiltonian bipartite graph to be bipancyclic (Q1193443)

From MaRDI portal
scientific article
Language Label Description Also known as
English
A condition for a Hamiltonian bipartite graph to be bipancyclic
scientific article

    Statements

    A condition for a Hamiltonian bipartite graph to be bipancyclic (English)
    0 references
    0 references
    27 September 1992
    0 references
    A bipartite graph of order \(2n\) is said to be bipancyclic if it contains a cycle of length \(2\ell\), for each \(\ell\), \(2\leq\ell\leq n\). The author proves the following result: Let \(G\) be a Hamiltonian bipartite graph of order \(2n\), and let \(C=x_ 1y_ 1x_ 2y_ 2\dots x_ ny_ nx_ 1\) be a Hamiltonian cycle of \(G\). If \(d(x_ 1)+d(x_ 2)\geq n+1\), then \(G\) is either: (1) bipancyclic, (2) missing an 4-cycle, (3) missing a \((n+1)\)-cycle.
    0 references
    Hamiltonian bipartite graph
    0 references
    Hamiltonian cycle
    0 references
    bipancyclic
    0 references

    Identifiers