Existence of angle labelings for essentially 3-connected maps
Statement
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.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.