Characterizing Minimal Interval Completions
From MaRDI portal
Publication:3590937
Recommendations
Cited in
(14)- Pathwidth is NP-Hard for Weighted Trees
- Pathwidth of Circular-Arc Graphs
- Characterizing and computing minimal cograph completions
- Minimal split completions
- On listing, sampling, and counting the chordal graphs with edge constraints
- Fixed-parameter complexity of minimum profile problems
- Profile minimization on products of graphs
- Characterizing and Computing Minimal Cograph Completions
- On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints
- The interval graph completion problem for the complete multipartite graphs
- On the proper interval completion problem within some chordal subclasses
- Strongly Chordal and Chordal Bipartite Graphs Are Sandwich Monotone
- Strongly chordal and chordal bipartite graphs are sandwich monotone
- Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions
This page was built for publication: Characterizing Minimal Interval Completions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3590937)