Circle-Representations of Simple 4-Regular Planar Graphs
نویسندگان
چکیده
Lovász conjectured that every connected 4-regular planar graph G admits a realization as a system of circles, 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, (a) we affirmatively answer Lovász’s conjecture, if G is 3-connected, and, (b) we demonstrate an infinite class of connected 4-regular planar graphs which are not 3-connected and do not admit a realization as a system of circles.
منابع مشابه
On a conjecture of Lovász on circle-representations of simple 4-regular planar graphs
Lovász conjectured that every connected 4-regular planar graph G admits a realization as a system of circles, 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 t...
متن کاملPlanar Lombardi Drawings for Subcubic Graphs
We prove that every planar graph with maximum degree three has a planar drawing in which the edges are drawn as circular arcs that meet at equal angles around every vertex. Our construction is based on the Koebe–Thurston–Andreev circle packing theorem, and uses a novel type of Voronoi diagram for circle packings that is invariant under Möbius transformations, defined using three-dimensional hyp...
متن کاملBalanced Circle Packings for Planar Graphs
We study balanced circle packings and circle-contact representations for planar graphs, where the ratio of the largest circle’s diameter to the smallest circle’s diameter is polynomial in the number of circles. We provide a number of positive and negative results for the existence of such balanced configurations.
متن کاملProportional Contact Representations of Planar Graphs
We study contact representations for planar graphs, with vertices represented by simple polygons and adjacencies represented by point-contacts or side-contacts between the corresponding polygons. Specifically, we consider proportional contact representations, where pre-specified vertex weights must be represented by the areas of the corresponding polygons. Natural optimization goals for such re...
متن کاملProportional Contact Representations of Planar Graphs Technical Report CS 2011 - 11
We study contact representations for planar graphs, with vertices represented by simple polygons and adjacencies represented by a point-contact or a side-contact between the corresponding polygons. Specifically, we consider proportional contact representations, where given vertex weights are represented by the areas of the corresponding polygons. Several natural optimization goals for such repr...
متن کامل