Simplicial Powers of Graphs
From MaRDI portal
Publication:5505654
DOI10.1007/978-3-540-85097-7_15zbMath1168.05341MaRDI QIDQ5505654
Andreas Brandstädt, Van Bang Le
Publication date: 27 January 2009
Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-85097-7_15
chordal graphs; block graphs; strongly chordal graphs; forbidden induced subgraph characterization; leaf powers; graph powers; ptolemaic graphs; simplicial powers
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
Related Items
The square of a block graph, Rooted directed path graphs are leaf powers, Characterising \((k,\ell )\)-leaf powers
Cites Work
- Unnamed Item
- Unnamed Item
- 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
- Exact leaf powers
- A forbidden induced subgraph characterization of distance-hereditary 5-leaf powers
- Characterizations of strongly chordal graphs
- On metric properties of certain clique graphs
- NeST graphs
- Neighborhood subtree tolerance graphs
- A note on the metric properties of trees
- Powers of distance-hereditary graphs
- Some remarks about leaf roots
- 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
- A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
- 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
- Algorithms and Computation
