A novel characterization of cubic Hamiltonian graphs via the associated quartic graphs

We give a necessary and sufficient condition for a cubic graph to be Hamiltonian by analyzing Eulerian tours in certain spanning subgraphs of the quartic graph associated with the cubic graph by 1-factor contraction. This correspondence is most useful in the case when it induces a blue and red 2-factorization of the associated quartic graph. We use this condition to characterize the Hamiltonian I-graphs, a further generalization of generalized Petersen graphs. The characterization of Hamiltonian I-graphs follows from the fact that one can choose a 1-factor in any I-graph in such a way that the corresponding associated quartic graph is a graph bundle having a cycle graph as base graph and a fiber and the fundamental factorization of graph bundles playing the role of blue and red factorization. The techniques that we develop allow us to represent Cayley multigraphs of degree 4, that are associated to abelian groups, as graph bundles. Moreover, we can find a family of connected cubic (multi)graphs that contains the family of connected I-graphs as a subfamily.

[1]  Herbert Fleischner,et al.  (Some of) the many uses of Eulerian graphs in graph theory (plus some applications) , 2001, Discret. Math..

[2]  Tomaž Pisanski,et al.  I‐graphs and the corresponding configurations , 2005 .

[3]  Jiuqiang Liu,et al.  Pseudo-cartesian product and hamiltonian decompositions of Cayley graphs on abelian groups , 1996, Discret. Math..

[4]  Tomaž Pisanski,et al.  GI-graphs: a new class of graphs with many symmetries , 2014 .

[5]  Claude Berge,et al.  The theory of graphs and its applications , 1962 .

[6]  B. A. Anderson.  Finite topologies and Hamiltonian paths , 1973 .

[7]  Tomaž Pisanski,et al.  Configurations from a Graphical Viewpoint , 2012, Ars Math. Contemp..

[8]  Mikhail E. Muzychuk,et al.  Ádám's Conjecture is True in the Square-Free Case , 1995, J. Comb. Theory, Ser. A.

[9]  Giuseppe Mazzuoccolo,et al.  Perfect one-factorizations in generalized Petersen graphs , 2011, Ars Comb..

[10]  F. Harary,et al.  The theory of graphs and its applications , 1963 .

[11]  Primoz Potocnik,et al.  Cubic vertex-transitive graphs on up to 1280 vertices , 2012, J. Symb. Comput..

[12]  Tomaz Pisanski,et al.  Isomorphism Checking of I-graphs , 2012, Graphs Comb..

[13]  Dragan Marusic,et al.  THE REMARKABLE GENERALIZED PETERSEN GRAPH (2(8,3) , 2000 .

[14]  David S. Johnson,et al.  The Planar Hamiltonian Circuit Problem is NP-Complete , 1976, SIAM J. Comput..

[15]  B. Elspas,et al.  Graphs with circulant adjacency matrices , 1970 .

[16]  Tomaz Pisanski,et al.  Straight-ahead walks in Eulerian graphs , 2004, Discret. Math..

[17]  Stan Wagon,et al.  Laceable knights , 2015, Ars Math. Contemp..

[18]  Charles Delorme,et al.  Isomorphisms of Cayley multigraphs of degree 4 on finite abelian groups , 1992, Eur. J. Comb..

[19]  Brian Alspach.  The classification of hamiltonian generalized Petersen graphs , 1983, J. Comb. Theory, Ser. B.

[20]  B. A. Anderson.  Symmetry groups of some perfect 1-factorizations of complete graphs , 1977, Discret. Math..