Simplicial powers of graphs
From MaRDI portal
Publication:1040586
Recommendations
Cites work
- 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 1865935 (Why is no real title available?)
- A note on the metric properties of trees
- 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
- Error compensation in leaf power problems
- 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
- Parallel concepts in graph theory
- 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
(5)
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)