On basic chordal graphs and some of its subclasses
From MaRDI portal
Publication:299101
DOI10.1016/j.dam.2015.05.002zbMath1339.05283OpenAlexW616597023MaRDI QIDQ299101
Marisa Gutierrez, Pablo De Caria
Publication date: 22 June 2016
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2015.05.002
Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
Cites Work
- Unnamed Item
- Reduced clique graphs of chordal graphs
- On rigid circuit graphs
- Clique graphs and Helly graphs
- Characterising \((k,\ell )\)-leaf powers
- Characterizations of strongly chordal graphs
- Intersection graphs of paths in a tree
- Recognizing clique graphs of directed and rooted path graphs
- Algorithmic graph theory and perfect graphs
- On the correspondence between tree representations of chordal and dually chordal graphs
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- Rebuilding convex sets in graphs
- Dually Chordal Graphs