Pages that link to "Item:Q3590937"
From MaRDI portal
The following pages link to Characterizing Minimal Interval Completions (Q3590937):
Displaying 12 items.
- Strongly chordal and chordal bipartite graphs are sandwich monotone (Q652637) (← links)
- Minimal split completions (Q967310) (← links)
- Characterizing and computing minimal cograph completions (Q972335) (← links)
- On listing, sampling, and counting the chordal graphs with edge constraints (Q974754) (← links)
- Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions (Q1001894) (← links)
- Profile minimization on products of graphs (Q2495515) (← links)
- Characterizing and Computing Minimal Cograph Completions (Q3507328) (← links)
- Pathwidth of Circular-Arc Graphs (Q3508573) (← links)
- On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints (Q3511357) (← links)
- Pathwidth is NP-Hard for Weighted Trees (Q5321709) (← links)
- Strongly Chordal and Chordal Bipartite Graphs Are Sandwich Monotone (Q5323088) (← links)
- On the proper interval completion problem within some chordal subclasses (Q6635117) (← links)
