Pages that link to "Item:Q3507328"
From MaRDI portal
The following pages link to Characterizing and Computing Minimal Cograph Completions (Q3507328):
Displaying 8 items.
- Strongly chordal and chordal bipartite graphs are sandwich monotone (Q652637) (← links)
- Characterizing and computing minimal cograph completions (Q972335) (← links)
- Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions (Q1001894) (← links)
- Dynamically maintaining split graphs (Q1026107) (← links)
- Minimal obstructions to \(( \infty , k )\)-polarity in cographs (Q2032730) (← links)
- Minimal comparability completions of arbitrary graphs (Q2476257) (← links)
- Strongly Chordal and Chordal Bipartite Graphs Are Sandwich Monotone (Q5323088) (← links)
- Faster and enhanced inclusion-minimal cograph completion (Q5915859) (← links)