Multiple Hamilton cycles in bipartite cubic graphs: an algebraic method

DOI10.1016/J.FFA.2016.11.006zbMATH Open1352.05103OpenAlexW2552214147MaRDI QIDQ730367FDOQ730367

David G. Glynn, Adel Alahmadi

Publication date: 27 December 2016

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ffa.2016.11.006

Recommendations

• Hamiltonian cycles in cubic 3-connected bipartite planar graphs
• scientific article; zbMATH DE number 1488848
• scientific article; zbMATH DE number 4063127
• Hamilton cycles in cubic graphs
• scientific article

zbMATH Keywords

bipartitegraphdeterminantfinite fieldHamilton cyclecubic\(\mathrm{GF}(2)\)

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Linear codes (general theory) (94B05) Finite ground fields in algebraic geometry (14G15) Finite geometry and special incidence structures (51E99)

Cites Work

• Title not available (Why is that?)
• Hamiltonian cycles in cubic 3-connected bipartite planar graphs
• Zeroes of Polynomials Over Finite Fields
• On Hamiltonian Circuits
• A remark to the decomposition of finite even regular graphs into linear factors
• Title not available (Why is that?)

Cited In (2)

• Det‐extremal cubic bipartite graphs
• Title not available (Why is that?)

This page was built for publication: Multiple Hamilton cycles in bipartite cubic graphs: an algebraic method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q730367)