Intersection graphs of induced subtrees of any graph and a generalization of chordal graphs
From MaRDI portal
Publication:2091798
Recommendations
Cites work
- A clique tree algorithm for partitioning a chordal graph into transitive subgraphs
- Characterizing intersection graphs of substars of a star.
- Graph-Theoretic Concepts in Computer Science
- scientific article; zbMATH DE number 554762 (Why is no real title available?)
- scientific article; zbMATH DE number 1501961 (Why is no real title available?)
- scientific article; zbMATH DE number 751126 (Why is no real title available?)
- Intersection graphs of Helly families of subtrees
- The intersection graphs of subtrees in trees are exactly the chordal graphs
Cited in
(6)- Subgraph trees in graph theory
- Families of induced trees and their intersection graphs
- Intersection graphs of \(k\)-acyclic families of subtrees and relational database query processing.
- Intersection representation of a chordal graph by subtrees of a spanning tree
- scientific article; zbMATH DE number 1011066 (Why is no real title available?)
- Recognising the overlap graphs of subtrees of restricted trees is hard
This page was built for publication: Intersection graphs of induced subtrees of any graph and a generalization of chordal graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2091798)