On asteroidal sets in chordal graphs
From MaRDI portal
Publication:2448883
DOI10.1016/J.DAM.2013.04.019zbMATH Open1288.05048OpenAlexW2067478465MaRDI QIDQ2448883FDOQ2448883
Authors: L. 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
Recommendations
- scientific article; zbMATH DE number 1107735
- On the structure of graphs with bounded asteroidal number
- On the structure of graphs with bounded asteroidal number
- Asteroidal Triple-Free Graphs
- Asteroidal triple-free graphs
- On the powers of graphs with bounded asteroidal number
- Independent Sets in Asteroidal Triple-Free Graphs
- Independent sets in asteroidal triple-free graphs
- scientific article; zbMATH DE number 5717213
- Asteroidal-triple-free interval \(k\)-graphs
Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)
Cites Work
- Graph theory
- Graph Classes: A Survey
- Decomposition by clique separators
- Intersection graphs of paths in a tree
- On the structure of graphs with bounded asteroidal number
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- Representation of a finite graph by a set of intervals on the real line
- Representations of chordal graphs as subtrees of a tree
- The leafage of a chordal graph
- Combinatorial optimization. Packing and covering
- Polynomial-Time Algorithm for the Leafage of Chordal Graphs
- A characterisation of rigid circuit graphs
- An algorithm for finding clique cut-sets
- Title not available (Why is that?)
- A generalization of AT-free graphs and a generic algorithm for solving triangulation problems
Cited In (7)
- Extended star graphs
- Graphs with at most two moplexes
- Clique trees of chordal graphs: leafage and 3-asteroidals
- Title not available (Why is that?)
- A decomposition theorem for chordal graphs and its applications
- Domination and Cut Problems on Chordal Graphs with Bounded Leafage
- Non-separating cliques, asteroidal number and leafage. The minimal 4-asteroidal split graphs
This page was built for publication: On asteroidal sets in chordal graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2448883)
