On a conjecture of Lovász on circle-representations of simple 4-regular planar graphs

• Main Authors: Michael A Bekos, Chrysanthi N Raftopoulou
• Format: Article
• Language: English
• Published: Carleton University 2015-02-01
• Series: Journal of Computational Geometry
• Online Access: http://jocg.org/index.php/jocg/article/view/120

Lovász conjectured that every connected 4-regular planar graph $G$ admits a <em>realization as a system of circles</em>, i.e., it can be drawn on the plane utilizing a set of circles, such that the vertices of $G$ correspond to the intersection and touching points of the circles and the edges of $G$ are the arc segments among pairs of intersection and touching points of the circles. In this paper, we settle this conjecture. In particular, (a) we first provide tight upper and lower bounds on the number of circles needed in a realization of any simple 4-regular planar graph, (b) we affirmatively answer Lovász's conjecture, if $G$ is 3-connected, and, (c) we demonstrate an infinite class of simple connected 4-regular planar graphs which are not 3-connected (i.e., either simply connected or biconnected) and do not admit realizations as a system of circles.