English

Whitney's Theorem for 2-Regular Planar Digraphs

Combinatorics 2017-06-12 v1

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~vv, the two edges directed away from vv are not consecutive in the local rotation around vv. 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.

Keywords

Cite

@article{arxiv.1706.02914,
  title  = {Whitney's Theorem for 2-Regular Planar Digraphs},
  author = {Dan Archdeacon and Matt DeVos and Stefan Hannie and Bojan Mohar},
  journal= {arXiv preprint arXiv:1706.02914},
  year   = {2017}
}

Comments

8 pages

R2 v1 2026-06-22T20:13:57.499Z