A circle graph is a graph that is isomorphic to the intersection graph of a finite collection of chords of a circle. The TREEWIDTH problem can be viewed upon as the problem of finding a chordal embedding of the graph that minimizes the clique number. Our algorithm to determine the tree...
Any right line passing through the center of a figure or body, as a circle, conic section, sphere, cube, etc., and terminated by the opposite boundaries; a straight line which bisects a system of parallel chords drawn in a curve. ...
determining the quadrangle includes determining the quadrangle to connect the first pen tip instance to the second pen tip instance, andwherein the first pen tip instance is a circle, the step of determining including determining two sides of the quadrangle to each be a tangent of the circle. ...
A circle graph is a graph that is isomorphic to the intersection graph of a finite collection of chords of a circle. The TREEWIDTH problem can be viewed upon as the problem of finding a chordal embedding of the graph that minimizes the clique number. Our algorithm to determine the tree...
A circle graph is an intersection graph of a set of chords of a circle. We describe the unavoidable induced subgraphs of circle graphs with large treewidth. This includes examples that are far from the 'usual suspects'. Our results imply that treewidth and Hadwiger number are linearly tied ...