The vertex leafage of chordal graphs
From MaRDI portal
Publication:2442202
DOI10.1016/j.dam.2012.12.006zbMath1285.05132OpenAlexW1522469957MaRDI QIDQ2442202
Publication date: 2 April 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2012.12.006
Related Items (5)
On models of directed path graphs non rooted directed path graphs ⋮ Parameterized algorithms for Steiner tree and dominating set: bounding the leafage by the vertex leafage ⋮ Computing a minimum subset feedback vertex set on chordal graphs parameterized by leafage ⋮ Computing a minimum subset feedback vertex set on chordal graphs parameterized by leafage ⋮ On \(H\)-topological intersection graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Equivalences and the complete hierarchy of intersection graphs of paths in a tree
- Intersection graphs of paths in a tree
- A recognition algorithm for the intersection graphs of paths in trees
- Constant tolerance intersection graphs of subtrees of a tree
- A characterisation of rigid circuit graphs
- A faster algorithm to recognize undirected path graphs
- Incidence matrices and interval graphs
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- Linear Algorithms for Chordal Graphs of Bounded Directed Vertex Leafage
- Polynomial-Time Algorithm for the Leafage of Chordal Graphs
- Characterizing path graphs by forbidden induced subgraphs
- Generating the maximum spanning trees of a weighted graph
- On the tree representation of chordal graphs
- Representations of chordal graphs as subtrees of a tree
- The leafage of a chordal graph
- What Is between Chordal and Weakly Chordal Graphs?
- The complexity of satisfiability problems
- Depth-First Search and Linear Graph Algorithms
This page was built for publication: The vertex leafage of chordal graphs
