Simplicial Powers of Graphs

DOI10.1007/978-3-540-85097-7_15zbMATH Open1168.05341OpenAlexW1588852442MaRDI QIDQ5505654FDOQ5505654

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

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

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)

Cites Work

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

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
• Title not available (Why is that?)

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)