Grinberg's criterion

DOI10.1016/j.ejc.2018.07.017zbMath1400.05138OpenAlexW2888935798MaRDI QIDQ1621061

Gunnar Brinkmann, Carol T. Zamfirescu

Publication date: 15 November 2018

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2018.07.017

zbMATH Keywords

Grinberg's Hamiltonicity criterion

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Eulerian and Hamiltonian graphs (05C45)

Related Items (2)

On 2-factors splitting an embedded graph into two plane graphs ⋮ Hamiltonian cycles and 1-factors in 5-regular graphs

Cites Work

• The smallest non-Hamiltonian 3-connected cubic planar graphs have 38 vertices
• Edge-disjoint Hamilton cycles in 4-regular planar graphs
• Extending an extension of Grinberg's theorem
• Planar and infinite hypohamiltonian and hypotraceable graphs
• On an extension of the Grinberg theorem
• Planar Hypohamiltonian Graphs on 40 Vertices
• A necessary condition for the existence of a circuit of any specified length
• New constructions of hypohamiltonian and hypotraceable graphs
• On Hamiltonian Walks in Graphs
• On Hamiltonian Circuits
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Grinberg's criterion