Pages that link to "Item:Q5468870"

The following pages link to Polynomial time recognition of unit circular-arc graphs (Q5468870):

Displaying 10 items.

• Partial characterizations of circle graphs (Q643006) (← links)
• Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs (Q967378) (← links)
• Obstacle numbers of graphs (Q977184) (← links)
• Characterizations and recognition of circular-arc graphs and subclasses: a survey (Q1045049) (← links)
• Completing colored graphs to meet a target property (Q2030434) (← links)
• Structural results on circular-arc graphs and circle graphs: a survey and the main open problems (Q2448877) (← links)
• NP-completeness results for edge modification problems (Q2500532) (← links)
• Bounded, minimal, and short representations of unit interval and unit circular-arc graphs. Chapter I: theory (Q2985115) (← links)
• Bounded, minimal, and short representations of unit interval and unit circular-arc graphs. Chapter II: algorithms (Q2985116) (← links)
• Circular‐Arc Bigraphs and Its Subclasses (Q5325948) (← links)