Year: 2018
Type: preprint
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.
Source: arXiv (Cornell University)
Institutions: The University of Sydney, University of Limerick
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2950314686