The following pages link to Proper Helly Circular-Arc Graphs (Q3508572):
Displayed 13 items.
- Certifying algorithms (Q465678) (← links)
- The clique operator on circular-arc graphs (Q987670) (← links)
- Characterizations and recognition of circular-arc graphs and subclasses: a survey (Q1045049) (← links)
- Normal Helly circular-arc graphs and its subclasses (Q1949109) (← links)
- Completing colored graphs to meet a target property (Q2030434) (← links)
- Subclasses of circular-arc bigraphs: Helly, normal and proper (Q2132386) (← links)
- Essential obstacles to Helly circular-arc graphs (Q2166233) (← links)
- Proper circular arc graphs as intersection graphs of paths on a grid (Q2416437) (← links)
- Structural results on circular-arc graphs and circle graphs: a survey and the main open problems (Q2448877) (← links)
- On cliques of Helly Circular-arc Graphs (Q3503539) (← links)
- A Simple Linear Time Algorithm for the Isomorphism Problem on Proper Circular-Arc Graphs (Q3512472) (← links)
- From a Circular-Arc Model to a Proper Circular-Arc Model (Q5302066) (← links)
- Extending partial representations of circular-arc graphs (Q6043187) (← links)