Rooted directed path graphs are leaf powers
From MaRDI portal
Publication:965972
DOI10.1016/J.DISC.2009.10.006zbMATH Open1211.05051OpenAlexW2093500811MaRDI QIDQ965972FDOQ965972
Authors: Andreas Brandstädt, Christian Hundt, F. Mancini, Peter Wagner 
Publication date: 27 April 2010
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2009.10.006
Recommendations
rooted directed path graphsstrongly chordal graphsleaf powersleaf roots(Unit) interval graphsfixed tolerance nest graphsgraph class inclusionsptolemaic graphs
Cites Work
- Topics in Intersection Graph Theory
- Graph Classes: A Survey
- On the clique-width of some perfect graph classes
- Tree spanners on chordal graphs: complexity and algorithms
- A Characterization of Comparability Graphs and of Interval Graphs
- Characterizations of strongly chordal graphs
- Distance-hereditary graphs
- Consecutive retrieval property -- revisited
- A characterization of ptolemaic graphs
- Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs
- A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
- A forbidden induced subgraph characterization of distance-hereditary 5-leaf powers
- 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
- The Isomorphism Problem For Directed Path Graphs and For Rooted Directed Path Graphs
- Ptolemaic Graphs and Interval Graphs Are Leaf Powers
- Simplicial Powers of Graphs
- On k- Versus (k + 1)-Leaf Powers
- Graph-Theoretic Concepts in Computer Science
- Structure and linear time recognition of 3-leaf powers
- Strictly chordal graphs are leaf powers
- Title not available (Why is that?)
- A Class of Balanced Matrices Arising from Location Problems
- Coloring powers of graphs of bounded clique-width.
- NeST graphs
Cited In (19)
- Linear-time algorithms for tree root problems
- A survey on pairwise compatibility graphs
- On graphs that are not PCGs
- Boxicity of leaf powers
- Recognition of linear and star variants of leaf powers is in P
- Recognizing k -Leaf Powers in Polynomial Time, for Constant k
- Parameterized algorithms for Steiner tree and (connected) dominating set on path graphs
- Pairwise compatibility graphs: a survey
- Computing optimal leaf roots of chordal cographs in linear time
- Maximal determinants of combinatorial matrices
- New results on pairwise compatibility graphs
- Parameterized leaf power recognition via embedding into graph products
- Ptolemaic Graphs and Interval Graphs Are Leaf Powers
- Fast diameter computation within split graphs
- Parameterized leaf power recognition via embedding into graph products
- On the pairwise compatibility property of some superclasses of threshold graphs
- Strictly chordal graphs are leaf powers
- Total coloring of rooted path graphs
- Revising Johnson's table for the 21st century
This page was built for publication: Rooted directed path graphs are leaf powers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q965972)
