Whitney's theorem for 2-regular planar digraphs

zbMATH Open1375.05064arXiv1706.02914MaRDI QIDQ4595181FDOQ4595181

Authors: Matt DeVos, Stefan Hannie, Bojan Mohar, Dan S. Archdeacon 

Publication date: 29 November 2017

Abstract: A digraph is 2-regular if every vertex has both indegree and outdegree two. We define an embedding of a 2-regular digraph to be a 2-cell embedding of the underlying graph in a closed surface with the added property that for every vertex~$v$, the two edges directed away from $v$ are not consecutive in the local rotation around $v$. In other words, at each vertex the incident edges are oriented in-out-in-out. The goal of this article is to provide an analogue of Whitney's theorem on planar embeddings in the setting of 2-regular digraphs. In the course of doing so, we note that Tutte's Theorem on peripheral cycles also has a natural analogue in this setting.

Full work available at URL: https://arxiv.org/abs/1706.02914

Recommendations

• scientific article; zbMATH DE number 7535271
• Obstructions to directed embeddings of Eulerian digraphs in the plane
• scientific article; zbMATH DE number 5723
• A note on the connectivity of 2‐regular digraphs
• Embedding digraphs on orientable surfaces

zbMATH Keywords

Tutte's theorem

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Planar graphs; geometric and topological aspects of graph theory (05C10)

Cited In (4)

• Partially broken orientations of Eulerian plane graphs
• Partially broken orientations of Eulerian graphs on closed surfaces
• A short proof and a strengthening of the Whitney 2-isomorphism theorem on graphs
• Title not available (Why is that?)

This page was built for publication: Whitney's theorem for 2-regular planar digraphs

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