Abstract:We say that G is an e-circle graph if there is a bijection between its vertices and straight lines on the cartesian plane such that two vertices are adjacent in G if and only if the corresponding lines intersect inside the circle of radius one. This definition suggests a method for deciding whether a given graph G is an e-circle graph, by constructing a convenient system S of equations and inequations which represents the structure of G, in such a way that G is an e-circle graph if and only if S has a solution… Show more
“…A Helly circle graph is a graph admitting a representation by chords of a circle satifying the Helly property, that is, any subset of intersecting chords contains a common point. A conjecture [40] asserts that a graph is a Helly circle graph if and only if it is a circle graph with no induced subgraph isomorphic to K 4 − e. See also [41].…”
Section: If G Has More Than N Cliques Then Stop As G Is Not Helly CImentioning
“…A Helly circle graph is a graph admitting a representation by chords of a circle satifying the Helly property, that is, any subset of intersecting chords contains a common point. A conjecture [40] asserts that a graph is a Helly circle graph if and only if it is a circle graph with no induced subgraph isomorphic to K 4 − e. See also [41].…”
Section: If G Has More Than N Cliques Then Stop As G Is Not Helly CImentioning
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.