Sign in
Back
Multiple Hamilton cycles in bipartite cubic graphs: An algebraic method
Journal article   Peer reviewed

Multiple Hamilton cycles in bipartite cubic graphs: An algebraic method

Adel N. Alahmadi and David G. Glynn
Finite fields and their applications, Vol.44, pp.18-21
03/2017
DOI: https://doi.org/10.1016/j.ffa.2016.11.006

Abstract

Bipartite Cubic Determinant Finite field Graph Hamilton cycle
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.

Metrics

1 Record Views

Details