Pages that link to "Item:Q3522966"
From MaRDI portal
The following pages link to Certifying Algorithms for Recognizing Proper Circular-Arc Graphs and Unit Circular-Arc Graphs (Q3522966):
Displaying 10 items.
- Certifying algorithms (Q465678) (← links)
- Powers of cycles, powers of paths, and distance graphs (Q531605) (← links)
- Linear-time recognition of Helly circular-arc models and graphs (Q627542) (← links)
- Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs (Q967378) (← links)
- The clique operator on circular-arc graphs (Q987670) (← links)
- Characterizations and recognition of circular-arc graphs and subclasses: a survey (Q1045049) (← links)
- A simple certifying algorithm for 3-edge-connectivity (Q2689444) (← links)
- Proper Helly Circular-Arc Graphs (Q3508572) (← 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)
