Testing superperfection of k-trees
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 3906520 (Why is no real title available?)
- scientific article; zbMATH DE number 176761 (Why is no real title available?)
- scientific article; zbMATH DE number 176762 (Why is no real title available?)
- scientific article; zbMATH DE number 3625441 (Why is no real title available?)
- A Characterization of Comparability Graphs and of Interval Graphs
- Algorithms finding tree-decompositions of graphs
- An interval graph is a comparability graph
- An interval graph is not a comparability graph
- Easy problems for tree-decomposable graphs
- Incidence matrices and interval graphs
- Linear time algorithms for NP-hard problems restricted to partial k- trees
- Normal hypergraphs and the perfect graph conjecture
- On Comparability and Permutation Graphs
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- Topics on perfect graphs
- Transitiv orientierbare Graphen
- Transitive Orientation of Graphs and Identification of Permutation Graphs
This page was built for publication: Testing superperfection of k-trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5056149)