External Reference
Multiple Hamilton cycles in bipartite cubic graphs: An algebraic method
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 Bosak, Kotzig, and Tutte that were originally proved differently. (C) 2016 Elsevier Inc. All rights reserved.

Authors: A. N. Alahmadi and D. G. Glynn

Open Page