Characterizing and computing the structure of clique intersections in strongly chordal graphs
From MaRDI portal
Publication:479046
DOI10.1016/J.DAM.2014.09.003zbMATH Open1304.05107OpenAlexW2002621149MaRDI QIDQ479046FDOQ479046
Authors: Ragnar Nevries, Christian Rosenke 
Publication date: 5 December 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2014.09.003
Recommendations
characterizationchordal graphclique treestrongly chordal graphclique arrangementclique separator graph
Cites Work
- Topics in Intersection Graph Theory
- Graph Classes: A Survey
- Incidence matrices and interval graphs
- On rigid circuit graphs
- On the tree representation of chordal graphs
- Three Partition Refinement Algorithms
- Characterizations of strongly chordal graphs
- Triangulated graphs and the elimination process
- The clique-separator graph for chordal graphs
- Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs
- Counting clique trees and computing perfect elimination schemes in parallel
- On graph powers for leaf-labeled trees
- Power of Natural Semijoins
- Algorithms and Computation
- Degrees of acyclicity for hypergraphs and relational database schemes
- Minimal weak separators of chordal graphs.
- Title not available (Why is that?)
- Strong clique trees, neighborhood trees, and strongly chordal graphs
Cited In (7)
- Finding intersection models: from chordal to Helly circular-arc graphs
- Title not available (Why is that?)
- Mutual transferability for \((F, B, R)\)-domination on strongly chordal graphs and cactus graphs
- Characterizing and computing the structure of clique intersections in strongly chordal graphs
- Vines and MAT-labeled graphs
- Finding dominating cliques efficiently, in strongly chordal graphs and undirected path graphs
- MAT-free graphic arrangements and a characterization of strongly chordal graphs by edge-labeling
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)
