Treelike comparability graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1262785 (Why is no real title available?)
- scientific article; zbMATH DE number 1333600 (Why is no real title available?)
- scientific article; zbMATH DE number 2077119 (Why is no real title available?)
- scientific article; zbMATH DE number 219236 (Why is no real title available?)
- scientific article; zbMATH DE number 2230209 (Why is no real title available?)
- A Combinatorial Decomposition Theory
- A Note on "The Comparability Graph of a Tree"
- A graph theoretical approach to the shunting problem
- A linear time algorithm to compute a dominating path in an AT-free graph
- Asteroidal Triple-Free Graphs
- Completely separable graphs
- Decomposition of Directed Graphs
- Graph Classes: A Survey
- Graph-Theoretic Concepts in Computer Science
- Introduction to algorithms
- On computing the number of linear extensions of a tree
- On the completeness of a generalized matching problem
- Tolerance graphs
- Track assignment
- Transforming trees by successive local complementations
- Trivially perfect graphs
Cited in
(9)- On monophonic position sets in graphs
- On the Galois lattice of bipartite distance hereditary graphs
- Distance-hereditary comparability graphs
- Word-representability of graphs with respect to split recomposition
- scientific article; zbMATH DE number 1756671 (Why is no real title available?)
- Graph-Theoretic Concepts in Computer Science
- Characterizations of treelike comparability graphs
- On the Galois Lattice of Bipartite Distance Hereditary Graphs
- Distance-hereditary comparability graphs
This page was built for publication: Treelike comparability graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1026130)