Whitney's theorem for 2-regular planar digraphs

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

Publication date 29 November 2017

Full work available at URL https://arxiv.org/abs/1706.02914, http://ajc.maths.uq.edu.au/pdf/67/ajc_v67_p159.pdf

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)

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.

Recommendations

Cited in

(4)

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)