Linear Algorithms for Chordal Graphs of Bounded Directed Vertex Leafage

DOI10.1016/j.endm.2009.02.014zbMath1267.05263OpenAlexW2070719150MaRDI QIDQ2839217

Juraj Stacho, Michel A. Habib

Publication date: 4 July 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2009.02.014

zbMATH Keywords

colouringcliquepath graphchordal graphlinear algorithms

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

The vertex leafage of chordal graphs

Cites Work

• Unnamed Item
• Unnamed Item
• A linear-time algorithm for a special case of disjoint set union
• A recognition algorithm for the intersection graphs of directed paths in directed trees
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• Representing triangulated graphs in stars
• Efficient graph representations
• A faster algorithm to recognize undirected path graphs
• The intersection graphs of subtrees in trees are exactly the chordal graphs
• An Optimal Solution for the Channel-Assignment Problem
• The leafage of a chordal graph

This page was built for publication: Linear Algorithms for Chordal Graphs of Bounded Directed Vertex Leafage