The following pages link to (Q3670598):
Displaying 12 items.
- A simpler linear-time recognition of circular-arc graphs (Q644807) (← links)
- Characterization and complexity of uniformly nonprimitive labeled 2-structures (Q672749) (← links)
- Parallel interval order recognition and construction of interval representations (Q673637) (← links)
- \(O(m\log n)\) split decomposition of strongly-connected graphs (Q972339) (← links)
- Circular-arc graphs with clique cover number two (Q1078197) (← links)
- Transitive closure for restricted classes of partial orders (Q1182064) (← links)
- \(P_ 4\)-trees and substitution decomposition (Q1201812) (← links)
- Modular decomposition and transitive orientation (Q1301738) (← links)
- A \(k\)-structure generalization of the theory of 2-structures (Q1334662) (← links)
- A recognition algorithm for orders of interval dimension two (Q1894368) (← links)
- O(m logn) Split Decomposition of Strongly Connected Graphs (Q3655150) (← links)
- A tight lower bound for primitivity in k-structures (Q4632456) (← links)
