The vertex leafage of chordal graphs

DOI10.1016/J.DAM.2012.12.006zbMATH Open1285.05132OpenAlexW1522469957MaRDI QIDQ2442202FDOQ2442202

Authors: Steven Chaplick, Juraj Stacho 

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

Recommendations

• Polynomial-Time Algorithm for the Leafage of Chordal Graphs
• The leafage of a chordal graph
• Vertex deletion problems on chordal graphs
• Linear algorithms for chordal graphs of bounded directed vertex leafage
• \(k\)-separator chordal graphs: leafage and subfamilies

zbMATH Keywords

path graphchordal graphclique treeleafagetree model

Mathematics Subject Classification ID

Trees (05C05) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites Work

• Title not available (Why is that?)
• Depth-First Search and Linear Graph Algorithms
• Intersection graphs of paths in a tree
• Incidence matrices and interval graphs
• The complexity of satisfiability problems
• The intersection graphs of subtrees in trees are exactly the chordal graphs
• Characterizing path graphs by forbidden induced subgraphs
• On the tree representation of chordal graphs
• Representations of chordal graphs as subtrees of a tree
• Equivalences and the complete hierarchy of intersection graphs of paths in a tree
• The leafage of a chordal graph
• A recognition algorithm for the intersection graphs of paths in trees
• Polynomial-Time Algorithm for the Leafage of Chordal Graphs
• A characterisation of rigid circuit graphs
• Generating the maximum spanning trees of a weighted graph
• Constant tolerance intersection graphs of subtrees of a tree
• A faster algorithm to recognize undirected path graphs
• What Is between Chordal and Weakly Chordal Graphs?
• Determining possible sets of leaves for spanning trees of dually chordal graphs.
• Linear algorithms for chordal graphs of bounded directed vertex leafage

Cited In (13)

• \(k\)-separator chordal graphs: leafage and subfamilies
• The Neighborhood Polynomial of Chordal Graphs
• Linear algorithms for chordal graphs of bounded directed vertex leafage
• Computing a minimum subset feedback vertex set on chordal graphs parameterized by leafage
• Polynomial-Time Algorithm for the Leafage of Chordal Graphs
• On \(H\)-topological intersection graphs
• On models of directed path graphs non rooted directed path graphs
• Parameterized algorithms for Steiner tree and (connected) dominating set on path graphs
• Recognising the overlap graphs of subtrees of restricted trees is hard
• 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
• Domination and Cut Problems on Chordal Graphs with Bounded Leafage
• On \(k\)-trees with given leafages

This page was built for publication: The vertex leafage of chordal graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2442202)