Multiple Hamilton Cycles in Bipartite Cubic Graphs: an Algebraic Method

Adel Alahmadi; David Glynn

doi:10.1016/j.ffa.2016.11.006

Multiple Hamilton Cycles in Bipartite Cubic Graphs: an Algebraic Method

Adel Alahmadi, David Glynn

Research output: Contribution to journal › Article › peer-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 language	English
Pages (from-to)	18-21
Number of pages	4
Journal	FINITE FIELDS AND THEIR APPLICATIONS
Volume	44
Issue number	March
DOIs	https://doi.org/10.1016/j.ffa.2016.11.006
Publication status	Published - 1 Mar 2017

Keywords

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

Access to Document

10.1016/j.ffa.2016.11.006

Cite this

@article{13e130095b3b46398575a63446409ff2,

title = "Multiple Hamilton Cycles in Bipartite Cubic Graphs: an Algebraic Method",

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{\'a}k, Kotzig, and Tutte that were originally proved differently.",

keywords = "Bipartite, Cubic, Determinant, Finite field, GF(2), Graph, Hamilton cycle",

author = "Adel Alahmadi and David Glynn",

year = "2017",

month = mar,

day = "1",

doi = "10.1016/j.ffa.2016.11.006",

language = "English",

volume = "44",

pages = "18--21",

journal = "FINITE FIELDS AND THEIR APPLICATIONS",

issn = "1071-5797",

publisher = "Academic Press Inc.",

number = "March",

}

TY - JOUR

T1 - Multiple Hamilton Cycles in Bipartite Cubic Graphs: an Algebraic Method

AU - Alahmadi, Adel

AU - Glynn, David

PY - 2017/3/1

Y1 - 2017/3/1

N2 - 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.

AB - 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.

KW - Bipartite

KW - Cubic

KW - Determinant

KW - Finite field

KW - GF(2)

KW - Graph

KW - Hamilton cycle

UR - http://www.scopus.com/inward/record.url?scp=84997017947&partnerID=8YFLogxK

U2 - 10.1016/j.ffa.2016.11.006

DO - 10.1016/j.ffa.2016.11.006

M3 - Article

SN - 1071-5797

VL - 44

SP - 18

EP - 21

JO - FINITE FIELDS AND THEIR APPLICATIONS

JF - FINITE FIELDS AND THEIR APPLICATIONS

IS - March

ER -

Multiple Hamilton Cycles in Bipartite Cubic Graphs: an Algebraic Method

Abstract

Keywords

Access to Document

Other files and links

Cite this