Pages that link to "Item:Q3512472"
From MaRDI portal
The following pages link to A Simple Linear Time Algorithm for the Isomorphism Problem on Proper Circular-Arc Graphs (Q3512472):
Displaying 8 items.
- On the isomorphism problem for Helly circular-arc graphs (Q259081) (← links)
- Solving the canonical representation and star system problems for proper circular-arc graphs in logspace (Q350727) (← links)
- Circular-arc hypergraphs: rigidity via connectedness (Q516817) (← links)
- The clique operator on circular-arc graphs (Q987670) (← links)
- Normal Helly circular-arc graphs and its subclasses (Q1949109) (← links)
- Revising Johnson's table for the 21st century (Q2091799) (← links)
- Complexity-separating graph classes for vertex, edge and total colouring (Q2184678) (← links)
- Fully dynamic recognition of proper circular-arc graphs (Q2350902) (← links)