Pages that link to "Item:Q1424251"

The following pages link to Linear-time recognition of circular-arc graphs (Q1424251):

Displaying 36 items.

• Solving the path cover problem on circular-arc graphs by using an approximation algorithm (Q2581561) (← links)
• Induced disjoint paths in circular-arc graphs in linear time (Q2629233) (← links)
• Succinct encodings for families of interval graphs (Q2661990) (← links)
• Compact representation of interval graphs and circular-arc graphs of bounded degree and chromatic number (Q2680858) (← links)
• Recognizing Threshold Tolerance Graphs in $$O(n^2)$$ Time (Q2945191) (← links)
• Interval Routing Schemes for Circular-Arc Graphs (Q2979675) (← links)
• SUB-COLORING AND HYPO-COLORING INTERVAL GRAPHS (Q3063603) (← links)
• Graph Classes with Structured Neighborhoods and Algorithmic Applications (Q3104764) (← links)
• Lexicographic Orientation Algorithms (Q3120444) (← links)
• On partitioning interval graphs into proper interval subgraphs and related problems (Q3174235) (← links)
• Direct and Certifying Recognition of Normal Helly Circular-Arc Graphs in Linear Time (Q3188829) (← links)
• Loop Graphs and Asteroidal Sets (Q3439331) (← links)
• Colouring Some Classes of Perfect Graphs Robustly (Q3439399) (← links)
• Partial Characterizations of Circular-Arc Graphs (Q3503529) (← links)
• Proper Helly Circular-Arc Graphs (Q3508572) (← links)
• Pathwidth of Circular-Arc Graphs (Q3508573) (← links)
• A Simple Linear Time Algorithm for the Isomorphism Problem on Proper Circular-Arc Graphs (Q3512472) (← links)
• Partial characterizations of circular-arc graphs (Q3652535) (← links)
• Recognition of Circle Graphs (Q4285912) (← links)
• (Q4601878) (← links)
• A linear time algorithm to recognize circular permutation graphs (Q4887747) (← links)
• (Q5005172) (← links)
• (Q5009627) (← links)
• (Q5111878) (← links)
• Bipartite Analogues of Comparability and Cocomparability Graphs (Q5128518) (← links)
• Min-Orderable Digraphs (Q5130576) (← links)
• From a Circular-Arc Model to a Proper Circular-Arc Model (Q5302066) (← links)
• Circular‐Arc Bigraphs and Its Subclasses (Q5325948) (← links)
• Polynomial time recognition of unit circular-arc graphs (Q5468870) (← links)
• A Simpler Linear-Time Recognition of Circular-Arc Graphs (Q5757898) (← links)
• Linear-Time Recognition of Probe Interval Graphs (Q5899485) (← links)
• Hardness and structural results for half-squares of restricted tree convex bipartite graphs (Q5919674) (← links)
• Maximum max-k-clique subgraphs in cactus subtree graphs (Q6132893) (← links)
• A graph-theoretic barcode ordering model for linked-reads (Q6487642) (← links)
• A polynomial kernel for proper Helly circular-arc vertex deletion (Q6547958) (← links)
• Computing optimal leaf roots of chordal cographs in linear time (Q6616231) (← links)