The Weighted Barycenter Drawing Recognition Problem
Abstract
We consider the question of whether a given graph drawing of a triconnected planar graph G is a weighted barycenter drawing. We answer the question with an elegant arithmetic characterisation using the faces of . This leads to positive answers when the graph is a Halin graph, and to a polynomial time recognition algorithm when the graph is cubic.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.