Circle Graphs

2021 ◽  
pp. 57-57
Author(s):  
Judy Leimbach ◽  
Kathy Leimbach ◽  
Mary Lou Johnson
Keyword(s):  
Circle Graphs

scholarly journals New clique and independent set algorithms for circle graphs

1992 ◽  
Vol 36 (1) ◽  
pp. 1-24 ◽  
Author(s):  
Alberto Apostolico ◽  
Mikhail J. Atallah ◽  
Susanne E. Hambrusch
Keyword(s):  
Independent Set ◽  
Circle Graphs

MINIMUM WEIGHT FEEDBACK VERTEX SETS IN CIRCLE n-GON GRAPHS AND CIRCLE TRAPEZOID GRAPHS

2011 ◽  
Vol 03 (03) ◽  
pp. 323-336 ◽  
Author(s):  
FANICA GAVRIL
Keyword(s):  
Minimum Weight ◽  
Polynomial Time Algorithm ◽  
Time Algorithm ◽  
Circle Graphs ◽  
Intersection Model ◽  
The Family ◽  
Positive Weights ◽  
Vertex Set ◽  
Vertex Sets ◽  
Trapezoid Graphs

A circle n-gon is the region between n or fewer non-crossing chords of a circle, no chord connecting the arcs between two other chords; the sides of a circle n-gon are either chords or arcs of the circle. A circle n-gon graph is the intersection graph of a family of circle n-gons in a circle. The family of circle trapezoid graphs is exactly the family of circle 2-gon graphs and the family of circle graphs is exactly the family of circle 1-gon graphs. The family of circle n-gon graphs contains the polygon-circle graphs which have an intersection representation by circle polygons, each polygon with at most n chords. We describe a polynomial time algorithm to find a minimum weight feedback vertex set, or equivalently, a maximum weight induced forest, in a circle n-gon graph with positive weights, when its intersection model by n-gon-interval-filaments is given.

scholarly journals Extending Partial Representations of Circle Graphs

2013 ◽  
pp. 131-142 ◽  
Author(s):  
Steven Chaplick ◽  
Radoslav Fulek ◽  
Pavel Klavík
Keyword(s):  
Circle Graphs

scholarly journals Structural results on circular-arc graphs and circle graphs: A survey and the main open problems

2014 ◽  
Vol 164 ◽  
pp. 427-443 ◽  
Author(s):  
Guillermo Durán ◽  
Luciano N. Grippo ◽  
Martín D. Safe
Keyword(s):  
Open Problems ◽  
Circle Graphs ◽  
Circular Arc ◽  
Circular Arc Graphs

scholarly journals Partitionable graphs, circle graphs, and the berge strong perfect graph conjecture

1983 ◽  
Vol 44 (1) ◽  
pp. 45-54 ◽  
Author(s):  
Mark A. Buckingham ◽  
Martin Charles Golumbic
Keyword(s):  
Perfect Graph ◽  
Circle Graphs
Sign in / Sign up

Export Citation Format

Share Document