{"title":"关于简单四正则平面图的圆表示的一个猜想Lovász","authors":"M. Bekos, Chrysanthi N. Raftopoulou","doi":"10.20382/jocg.v6i1a1","DOIUrl":null,"url":null,"abstract":"Lovasz 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 Lovasz'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.","PeriodicalId":43044,"journal":{"name":"Journal of Computational Geometry","volume":"9 2-4 1","pages":"138-149"},"PeriodicalIF":0.4000,"publicationDate":"2012-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":"{\"title\":\"On a conjecture of Lovász on circle-representations of simple 4-regular planar graphs\",\"authors\":\"M. Bekos, Chrysanthi N. Raftopoulou\",\"doi\":\"10.20382/jocg.v6i1a1\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Lovasz 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 Lovasz'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.\",\"PeriodicalId\":43044,\"journal\":{\"name\":\"Journal of Computational Geometry\",\"volume\":\"9 2-4 1\",\"pages\":\"138-149\"},\"PeriodicalIF\":0.4000,\"publicationDate\":\"2012-09-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"14\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Computational Geometry\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.20382/jocg.v6i1a1\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Computational Geometry","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.20382/jocg.v6i1a1","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS","Score":null,"Total":0}
On a conjecture of Lovász on circle-representations of simple 4-regular planar graphs
Lovasz 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 Lovasz'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.