Simplicial powers of graphs
From MaRDI portal
Publication:1040586
DOI10.1016/j.tcs.2009.04.010zbMath1192.68473OpenAlexW1990543619MaRDI QIDQ1040586
Andreas Brandstädt, Van Bang Le
Publication date: 25 November 2009
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2009.04.010
chordal graphsblock graphsstrongly chordal graphsforbidden induced subgraphleaf powersgraph powersptolemaic graphssimplicial powers
Related Items
Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences ⋮ Non-inclusion and other subclasses of chordal graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Clique graphs and Helly graphs
- Structure and linear time recognition of 3-leaf powers
- Strictly chordal graphs are leaf powers
- Characterizations of strongly chordal graphs
- On metric properties of certain clique graphs
- Parallel concepts in graph theory
- NeST graphs
- Neighborhood subtree tolerance graphs
- A note on the metric properties of trees
- Some remarks about leaf roots
- Error compensation in leaf power problems
- Rebuilding convex sets in graphs
- On Graph Powers for Leaf-Labeled Trees
- The 3-Steiner Root Problem
- On (k,ℓ)-Leaf Powers
- Doubly Lexical Orderings of Matrices
- Dually Chordal Graphs
- Graph Classes: A Survey
- Computing Phylogenetic Roots with Bounded Degrees and Errors
- Structure and linear-time recognition of 4-leaf powers
- Ptolemaic Graphs and Interval Graphs Are Leaf Powers
