Existence of angle labelings for essentially 3-connected maps
Existence of angle labelings for essentially 3-connected maps
Let be a map on a genus orientable surface. An edge, positive-vertex, positive-face angle labeling means a labeling with the edge condition and positive vertex and face conditions indicated by those parameters. A map is essentially 3-connected when its universal-cover graph is 3-connected in the relevant essential sense. The angle-labeling conjecture. admits an edge, -vertex, -face angle labeling if and only if it is essentially 3-connected.
The “only if” direction is supported by the cited proposition and lemma; the converse is proposed as the general-map analogue of the preceding triangulation conjecture.
Sources & referencesView supporting material
Primary source
Benjamin Lévêque, “Generalization of Schnyder woods to orientable surfaces and applications”, arXiv:1702.07589 (2017).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.