The intersection graphs of subtrees in trees are exactly the chordal graphs
type: Item
instance of: scholarly article
title: The intersection graphs of subtrees in trees are exactly the chordal graphs
zbMATH Open document ID: 0266.05101
DOI: 10.1016/0095-8956(74)90094-X
published in: Journal of Combinatorial Theory. Series B
publication date: 1974-01-01T00:00:00Z
Mathematics Subject Classification ID: 05C99
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 3419154
Wikidata QID: Q56430108
author: Fanica Gavril
MaRDI profile type: Publication
cites work: A Characterization of Comparability Graphs and of Interval Graphs
cites work: Representation of a finite graph by a set of intervals on the real line
cites work: Incidence matrices and interval graphs
cites work: Q5588432
cites work: Incidence matrices, interval graphs and seriation in archeology
cites work: Construction of TernaryHv-groups and TernaryP-hyperoperations
cites work: Matrix characterizations of circular-arc graphs
cites work: Intersection representations of graphs by arcs
cites work: On rigid circuit graphs
cites work: Triangulated graphs and the elimination process
cites work: Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
full work available at URL: 0095-8956(74)90094-x
OpenAlex ID: W1978452004
description: scientific article