Pages that link to "Item:Q5757898"

The following pages link to A Simpler Linear-Time Recognition of Circular-Arc Graphs (Q5757898):

Displaying 13 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)
• Some results on the limits of thought (Q1633235) (← links)
• Distributed interactive proofs for the recognition of some geometric intersection graph classes (Q2097349) (← links)
• Essential obstacles to Helly circular-arc graphs (Q2166233) (← 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)
• Maximum max-k-clique subgraphs in cactus subtree graphs (Q6132893) (← links)