Pages that link to "Item:Q3591328"

The following pages link to Characterizations and Linear Time Recognition of Helly Circular-Arc Graphs (Q3591328):

Displaying 18 items.

• Finding intersection models: from chordal to Helly circular-arc graphs (Q409451) (← links)
• Linear-time recognition of Helly circular-arc models and graphs (Q627542) (← links)
• A simpler linear-time recognition of circular-arc graphs (Q644807) (← links)
• Algorithms for finding clique-transversals of graphs (Q940841) (← links)
• Characterizations and recognition of circular-arc graphs and subclasses: a survey (Q1045049) (← links)
• Linear-time recognition of circular-arc graphs (Q1424251) (← links)
• Normal Helly circular-arc graphs and its subclasses (Q1949109) (← links)
• Subclasses of circular-arc bigraphs: Helly, normal and proper (Q2132386) (← links)
• Essential obstacles to Helly circular-arc graphs (Q2166233) (← links)
• On some graph classes related to perfect graphs: a survey (Q2184662) (← links)
• Structural results on circular-arc graphs and circle graphs: a survey and the main open problems (Q2448877) (← links)
• Clique-coloring circular-arc graphs (Q2840551) (← links)
• Direct and Certifying Recognition of Normal Helly Circular-Arc Graphs in Linear Time (Q3188829) (← links)
• Polynomial time recognition of unit circular-arc graphs (Q5468870) (← links)
• A Simpler Linear-Time Recognition of Circular-Arc Graphs (Q5757898) (← links)
• On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid (Q5915780) (← links)
• A polynomial kernel for proper Helly circular-arc vertex deletion (Q6547958) (← links)
• Recognition and isomorphism of proper \(H \)-graphs for unicyclic \(H\) in \textit{FPT}-time (Q6575404) (← links)