Comparing trees characteristic to chordal and dually chordal graphs
From MaRDI portal
Publication:2840679
DOI10.1016/J.ENDM.2011.05.007zbMATH Open1268.05170OpenAlexW2078394769MaRDI QIDQ2840679FDOQ2840679
Authors: Pablo De Caria, M. Gutierrez 
Publication date: 23 July 2013
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.endm.2011.05.007
Recommendations
- On the correspondence between tree representations of chordal and dually chordal graphs
- Characterizations of treelike comparability graphs
- Characterizing 2-trees relative to chordal and series-parallel graphs
- On the tree representation of chordal graphs
- Graph-Theoretic Concepts in Computer Science
- Tree-decompositions, tree-representability and chordal graphs
- scientific article; zbMATH DE number 1230485
- Distance Approximating Trees for Chordal and Dually Chordal Graphs
- Characterizing clique graphs of chordal comparability graphs
- Dualizing chordal graphs
Cites Work
Cited In (6)
- Determining possible sets of leaves for spanning trees of dually chordal graphs.
- On basic chordal graphs and some of its subclasses
- On minimal vertex separators of dually chordal graphs: properties and characterizations
- Graph-Theoretic Concepts in Computer Science
- On the correspondence between tree representations of chordal and dually chordal graphs
- Neighborhood inclusion posets and tree representations for chordal and dually chordal graphs
This page was built for publication: Comparing trees characteristic to chordal and dually chordal graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2840679)
