Characterizing and computing the structure of clique intersections in strongly chordal graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 17505 (Why is no real title available?)
- Algorithms and Computation
- Characterizations of strongly chordal graphs
- Counting clique trees and computing perfect elimination schemes in parallel
- Degrees of acyclicity for hypergraphs and relational database schemes
- Graph Classes: A Survey
- Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs
- Incidence matrices and interval graphs
- Minimal weak separators of chordal graphs.
- On graph powers for leaf-labeled trees
- On rigid circuit graphs
- On the tree representation of chordal graphs
- Power of Natural Semijoins
- Strong clique trees, neighborhood trees, and strongly chordal graphs
- The clique-separator graph for chordal graphs
- Three Partition Refinement Algorithms
- Topics in Intersection Graph Theory
- Triangulated graphs and the elimination process
Cited in
(7)- Characterizing and computing the structure of clique intersections in strongly chordal graphs
- Vines and MAT-labeled graphs
- Finding intersection models: from chordal to Helly circular-arc graphs
- Finding dominating cliques efficiently, in strongly chordal graphs and undirected path graphs
- scientific article; zbMATH DE number 4093512 (Why is no real title available?)
- MAT-free graphic arrangements and a characterization of strongly chordal graphs by edge-labeling
- Mutual transferability for \((F, B, R)\)-domination on strongly chordal graphs and cactus graphs
This page was built for publication: Characterizing and computing the structure of clique intersections in strongly chordal graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q479046)
