Intersection graphs of induced subtrees of any graph and a generalization of chordal graphs

DOI10.1016/j.dam.2021.04.006zbMath1502.05213OpenAlexW3162605084MaRDI QIDQ2091798

Pablo De Caria

Publication date: 2 November 2022

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2021.04.006

zbMATH Keywords

bipartite graphintersection graphchordal graphsubtreeclique treeclique representation

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A clique tree algorithm for partitioning a chordal graph into transitive subgraphs
• Intersection graphs of Helly families of subtrees
• The intersection graphs of subtrees in trees are exactly the chordal graphs
• Graph-Theoretic Concepts in Computer Science

This page was built for publication: Intersection graphs of induced subtrees of any graph and a generalization of chordal graphs