On asteroidal sets in chordal graphs

DOI10.1016/j.dam.2013.04.019zbMath1288.05048OpenAlexW2067478465MaRDI QIDQ2448883

Liliana Alcón

Publication date: 5 May 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2013.04.019

zbMATH Keywords

chordal graphsasteroidal numberclique separatorsSperner familiesleafageclutters

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)

Cites Work

• Decomposition by clique separators
• Intersection graphs of paths in a tree
• An algorithm for finding clique cut-sets
• A generalization of AT-free graphs and a generic algorithm for solving triangulation problems
• A characterisation of rigid circuit graphs
• The intersection graphs of subtrees in trees are exactly the chordal graphs
• Combinatorial Optimization
• Representation of a finite graph by a set of intervals on the real line
• Polynomial-Time Algorithm for the Leafage of Chordal Graphs
• Representations of chordal graphs as subtrees of a tree
• The leafage of a chordal graph
• Graph Classes: A Survey
• On the structure of graphs with bounded asteroidal number
• Unnamed Item
• Unnamed Item

This page was built for publication: On asteroidal sets in chordal graphs