Split Euler tours in 4-regular planar graphs

DOI10.7151/dmgt.1836zbMath1329.05153OpenAlexW2574292975MaRDI QIDQ907827

B. D. Daniel, W. Paul Wright, R. Guidry, P. J. Couch

Publication date: 26 January 2016

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1836

zbMATH Keywords

planar3-connectedNP-complete4-regularsplit Euler tour

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10) Structural characterization of families of graphs (05C75)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cycles of length 0 modulo 4 in graphs
• Light subgraphs of graphs embedded in the plane. A survey
• Colouring vertices of plane graphs under restrictions given by faces
• Generating all planer graphs regular of degree four
• Generating all 4-regular planar graphs from the graph of the octahedron
• The Planar Hamiltonian Circuit Problem is NP-Complete
• Generating all 3‐connected 4‐regular planar graphs from the octahedron graph

This page was built for publication: Split Euler tours in 4-regular planar graphs