On k-tree containment graphs of paths in a tree
From MaRDI portal
Publication:2035089
Recommendations
Cites work
- scientific article; zbMATH DE number 3172312 (Why is no real title available?)
- scientific article; zbMATH DE number 6157247 (Why is no real title available?)
- Algorithmic Aspects of Vertex Elimination on Graphs
- Characterization problems for graphs, partially ordered sets, lattices, and families of sets
- Containment Graphs, Posets, and Related Classes of Graphs
- Cycle-free partial orders and chordal comparability graphs
- Geometric containment orders: A survey
- Graph Classes: A Survey
- On Comparability and Permutation Graphs
- On containment graphs of paths in a tree
- On simple characterizations of k-trees
- Partially Ordered Sets
- Recent results on containment graphs of paths in a tree
- The 3-Irreducible Partially Ordered Sets
- The dimension of cycle-free orders
- Transitiv orientierbare Graphen
Cited in
(3)
This page was built for publication: On \(k\)-tree containment graphs of paths in a tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2035089)