Testing superperfection of k-trees
From MaRDI portal
Publication:5056149
DOI10.1007/3-540-55706-7_25zbMath1506.05200WikidataQ59568008 ScholiaQ59568008MaRDI QIDQ5056149
Publication date: 9 December 2022
Published in: Algorithm Theory — SWAT '92 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-55706-7_25
05C85: Graph algorithms (graph-theoretic aspects)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Topics on perfect graphs
- Linear time algorithms for NP-hard problems restricted to partial k- trees
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- Incidence matrices and interval graphs
- Normal hypergraphs and the perfect graph conjecture
- Algorithms finding tree-decompositions of graphs
- Easy problems for tree-decomposable graphs
- On Comparability and Permutation Graphs
- Transitiv orientierbare Graphen
- An interval graph is not a comparability graph
- An interval graph is a comparability graph
- Transitive Orientation of Graphs and Identification of Permutation Graphs
- A Characterization of Comparability Graphs and of Interval Graphs