Pages that link to "Item:Q5459137"
From MaRDI portal
The following pages link to Making Arbitrary Graphs Transitively Orientable: Minimal Comparability Completions (Q5459137):
Displayed 4 items.
- Minimal proper interval completions (Q963366) (← links)
- Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions (Q1001894) (← links)
- Dynamically maintaining split graphs (Q1026107) (← links)
- Characterizing and Computing Minimal Cograph Completions (Q3507328) (← links)