Simplicial Powers of Graphs

DOI10.1007/978-3-540-85097-7_15MaRDI QIDQ5505654zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

chordal graphsforbidden induced subgraph characterizationstrongly chordal graphsblock graphsleaf powersgraph powersptolemaic graphssimplicial powers

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Simplicial powers of graphs
• Characterising \((k,\ell )\)-leaf powers
• On (k,ℓ)-Leaf Powers
• Structure and linear time recognition of 3-leaf powers
• Structure and linear-time recognition of 4-leaf powers

Cites work

• scientific article; zbMATH DE number 3889566 (Why is no real title available?)
• scientific article; zbMATH DE number 4077265 (Why is no real title available?)
• scientific article; zbMATH DE number 53860 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 2077119 (Why is no real title available?)
• scientific article; zbMATH DE number 2080275 (Why is no real title available?)
• scientific article; zbMATH DE number 1865935 (Why is no real title available?)
• A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
• A forbidden induced subgraph characterization of distance-hereditary 5-leaf powers
• A note on the metric properties of trees
• Algorithms and Computation
• Characterizations of strongly chordal graphs
• Clique graphs and Helly graphs
• Computing Phylogenetic Roots with Bounded Degrees and Errors
• Doubly Lexical Orderings of Matrices
• Dually Chordal Graphs
• Exact leaf powers
• Graph Classes: A Survey
• NeST graphs
• Neighborhood subtree tolerance graphs
• On (k,ℓ)-Leaf Powers
• On graph powers for leaf-labeled trees
• On metric properties of certain clique graphs
• Powers of distance-hereditary graphs
• Ptolemaic Graphs and Interval Graphs Are Leaf Powers
• Rebuilding convex sets in graphs
• Some remarks about leaf roots
• Strictly chordal graphs are leaf powers
• Structure and linear time recognition of 3-leaf powers
• Structure and linear-time recognition of 4-leaf powers
• The 3-Steiner Root Problem

Cited in

(7)

• The square of a block graph
• Characterising \((k,\ell )\)-leaf powers
• Simplicial complexes of graphs
• Strongly simplicial vertices of powers of trees
• Distinguished minimal topological lassos
• Rooted directed path graphs are leaf powers
• scientific article; zbMATH DE number 6157492 (Why is no real title available?)

This page was built for publication: Simplicial Powers of Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5505654)