On basic chordal graphs and some of its subclasses
From MaRDI portal
(Redirected from Publication:299101)
Recommendations
- On the correspondence between tree representations of chordal and dually chordal graphs
- Comparing trees characteristic to chordal and dually chordal graphs
- Non-inclusion and other subclasses of chordal graphs
- Clique tree generalization and new subclasses of chordal graphs
- scientific article; zbMATH DE number 554762
Cites work
- scientific article; zbMATH DE number 3402664 (Why is no real title available?)
- Algorithmic graph theory and perfect graphs
- Characterising \((k,\ell )\)-leaf powers
- Characterizations of strongly chordal graphs
- Clique graphs and Helly graphs
- Dually Chordal Graphs
- Intersection graphs of paths in a tree
- On rigid circuit graphs
- On the correspondence between tree representations of chordal and dually chordal graphs
- Rebuilding convex sets in graphs
- Recognizing clique graphs of directed and rooted path graphs
- Reduced clique graphs of chordal graphs
- The intersection graphs of subtrees in trees are exactly the chordal graphs
Cited in
(5)- Non-inclusion and other subclasses of chordal graphs
- scientific article; zbMATH DE number 4132197 (Why is no real title available?)
- Fuzzy chordal graphs and its properties
- On the correspondence between tree representations of chordal and dually chordal graphs
- Extending Partial Representations of Subclasses of Chordal Graphs
This page was built for publication: On basic chordal graphs and some of its subclasses
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q299101)