Minimal Split Completions of Graphs
From MaRDI portal
Publication:3525793
DOI10.1007/11682462_55zbMath1145.05324OpenAlexW1879510370MaRDI QIDQ3525793
Pinar Heggernes, Federico Mancini
Publication date: 18 September 2008
Published in: LATIN 2006: Theoretical Informatics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11682462_55
Related Items (10)
Strongly Chordal and Chordal Bipartite Graphs Are Sandwich Monotone ⋮ Characterizing and Computing Minimal Cograph Completions ⋮ Minimum Fill-In and Treewidth of Split+ ke and Split+ kv Graphs ⋮ Minimal comparability completions of arbitrary graphs ⋮ Minimal proper interval completions ⋮ Characterizing and computing minimal cograph completions ⋮ Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions ⋮ Minimal interval completion through graph exploration ⋮ On finding separators in temporal split and permutation graphs ⋮ Dynamically maintaining split graphs
This page was built for publication: Minimal Split Completions of Graphs