Algorithms for generating strongly chordal graphs
From MaRDI portal
Publication:2233439
Recommendations
Cites work
- \(k\)-tuple domination in graphs
- A characterization of strongly chordal graphs
- A new characterization of strongly chordal graphs
- A separator-based method for generating weakly chordal graphs
- Algorithmic Aspects of Vertex Elimination on Graphs
- Algorithmic graph theory and perfect graphs
- Characterizations of strongly chordal graphs
- Domination, independent domination, and duality in strongly chordal graphs
- scientific article; zbMATH DE number 1185294 (Why is no real title available?)
- Linear-time generation of random chordal graphs
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- Two methods for the generation of chordal graphs
Cited in
(8)- Regular vines with strongly chordal pattern of (conditional) independence
- Strengthening strongly chordal graphs
- Improved algorithms for weakly chordal graphs
- scientific article; zbMATH DE number 1302027 (Why is no real title available?)
- Linear-time generation of random chordal graphs
- Generating weakly chordal graphs from arbitrary graphs
- Cayley trees and increasing 1, 2-trees: let's twist!
- Two methods for the generation of chordal graphs
This page was built for publication: Algorithms for generating strongly chordal graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2233439)