Simplicial powers of graphs

DOI10.1016/J.TCS.2009.04.010zbMATH Open1192.68473OpenAlexW1990543619MaRDI QIDQ1040586FDOQ1040586

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

zbMATH Keywords

chordal graphsstrongly chordal graphsblock graphsforbidden induced subgraphleaf powersgraph powersptolemaic graphssimplicial powers

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A note on the metric properties of trees
• Graph Classes: A Survey
• Rebuilding convex sets in graphs
• Characterizations of strongly chordal graphs
• Parallel concepts in graph theory
• Dually Chordal Graphs
• Doubly Lexical Orderings of Matrices
• Clique graphs and Helly graphs
• On metric properties of certain clique graphs
• Neighborhood subtree tolerance graphs
• Some remarks about leaf roots
• Error compensation in leaf power problems
• 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
• Computing Phylogenetic Roots with Bounded Degrees and Errors
• Strictly chordal graphs are leaf powers
• NeST graphs

Cited In (4)

• Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences
• Non-inclusion and other subclasses of chordal graphs
• Simplicial complexes of graphs
• 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 Q1040586)