On 2-factors splitting an embedded graph into two plane graphs

DOI10.1007/s00373-022-02473-3zbMath1486.05056OpenAlexW4293084535MaRDI QIDQ2121487

Gunnar Brinkmann, Sara Chiers, Carol T. Zamfirescu

Publication date: 4 April 2022

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-022-02473-3

zbMATH Keywords

2-factorHamiltonian cycleembedded graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Eulerian and Hamiltonian graphs (05C45) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Uses Software

• House of Graphs
• GENREG

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Grinberg's criterion
• House of Graphs: a database of interesting graphs
• Disjoint paths, planarizing cycles, and spanning walks
• A Theorem on Planar Graphs
• Fast generation of regular graphs and construction of cages
• Fast generation of cubic graphs

This page was built for publication: On 2-factors splitting an embedded graph into two plane graphs