Pages that link to "Item:Q5757898"
From MaRDI portal
The following pages link to A Simpler Linear-Time Recognition of Circular-Arc Graphs (Q5757898):
Displaying 21 items.
- Coloring fuzzy circular interval graphs (Q412282) (← links)
- A simpler linear-time recognition of circular-arc graphs (Q644807) (← links)
- Intersection representations of matrices by subtrees and unicycles on graphs (Q935839) (← 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)
- Linear-time recognition of circular-arc graphs (Q1424251) (← links)
- Some results on the limits of thought (Q1633235) (← links)
- On the recognition of digital circles in linear time (Q1803274) (← links)
- Distributed interactive proofs for the recognition of some geometric intersection graph classes (Q2097349) (← links)
- Essential obstacles to Helly circular-arc graphs (Q2166233) (← links)
- Recognizing generalized transmission graphs of line segments and circular sectors (Q2294728) (← links)
- Fully dynamic recognition of proper circular-arc graphs (Q2350902) (← links)
- Direct and Certifying Recognition of Normal Helly Circular-Arc Graphs in Linear Time (Q3188829) (← links)
- Proper Helly Circular-Arc Graphs (Q3508572) (← links)
- A Simple Linear Time Algorithm for the Isomorphism Problem on Proper Circular-Arc Graphs (Q3512472) (← links)
- Recognition of Circle Graphs (Q4285912) (← links)
- A linear time algorithm to recognize circular permutation graphs (Q4887747) (← links)
- From a Circular-Arc Model to a Proper Circular-Arc Model (Q5302066) (← links)
- Polynomial time recognition of unit circular-arc graphs (Q5468870) (← links)
- Maximum max-k-clique subgraphs in cactus subtree graphs (Q6132893) (← links)
