Multiple Hamilton Cycles in Bipartite Cubic Graphs: an Algebraic Method

Adel Alahmadi, David Glynn

    Research output: Contribution to journalArticlepeer-review

    Abstract

    Many important graphs are bipartite and cubic (i.e. bipartite and trivalent, or “bicubic”). We explain concisely how the Hamilton cycles of this type of graph are characterized by a single determinantal condition over GF(2). Thus algebra may be used to derive results such as those of Bosák, Kotzig, and Tutte that were originally proved differently.

    Original languageEnglish
    Pages (from-to)18-21
    Number of pages4
    JournalFINITE FIELDS AND THEIR APPLICATIONS
    Volume44
    Issue numberMarch
    DOIs
    Publication statusPublished - 1 Mar 2017

    Keywords

    • Bipartite
    • Cubic
    • Determinant
    • Finite field
    • GF(2)
    • Graph
    • Hamilton cycle

    Fingerprint Dive into the research topics of 'Multiple Hamilton Cycles in Bipartite Cubic Graphs: an Algebraic Method'. Together they form a unique fingerprint.

    Cite this