On \(k\)-tree containment graphs of paths in a tree
From MaRDI portal
Publication:2035089
DOI10.1007/s11083-020-09536-1OpenAlexW3080909644MaRDI QIDQ2035089
Liliana Alcón, Noemí Gudiño, Marisa Gutierrez
Publication date: 24 June 2021
Published in: Order (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11083-020-09536-1
Cites Work
- Unnamed Item
- Unnamed Item
- On containment graphs of paths in a tree
- Cycle-free partial orders and chordal comparability graphs
- Characterization problems for graphs, partially ordered sets, lattices, and families of sets
- Geometric containment orders: A survey
- Recent results on containment graphs of paths in a tree
- The dimension of cycle-free orders
- On simple characterizations of k-trees
- On Comparability and Permutation Graphs
- Containment Graphs, Posets, and Related Classes of Graphs
- Algorithmic Aspects of Vertex Elimination on Graphs
- The 3-Irreducible Partially Ordered Sets
- Graph Classes: A Survey
- Transitiv orientierbare Graphen
- Partially Ordered Sets
This page was built for publication: On \(k\)-tree containment graphs of paths in a tree