Intersection models of weakly chordal graphs
type: Item
instance of: scholarly article
title: Intersection models of weakly chordal graphs
zbMATH Open document ID: 1197.05098
author: Martin Charles Golumbic
author: Marina Lipshteyn
author: Michal Stern
published in: Discrete Applied Mathematics
publication date: 2009-06-24T00:00:00Z
Mathematics Subject Classification ID: 05C62
Mathematics Subject Classification ID: 05C75
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 5569436
zbMATH Keywords: weakly chordal graph
zbMATH Keywords: edge intersection graph of subtrees on a tree
MaRDI profile type: Publication
full work available at URL: j.dam.2008.11.017
OpenAlex ID: W1981728803
cites work: A characterisation of rigid circuit graphs
cites work: The intersection graphs of subtrees in trees are exactly the chordal graphs
cites work: Q4828541
cites work: Efficient graph representations
cites work: Tolerance intersection graphs on binary trees with constant tolerance 3
cites work: Constant tolerance intersection graphs of subtrees of a tree
cites work: Connectivity threshold for random chordal graphs
cites work: The edge intersection graphs of paths in a tree
cites work: Q4677945
cites work: The \(k\)-edge intersection graphs of paths in a tree
cites work: Q3576666
cites work: Equivalences and the complete hierarchy of intersection graphs of paths in a tree
cites work: Optimizing weakly triangulated graphs
cites work: Finding Intersection Models of Weakly Chordal Graphs
cites work: Q3941433
cites work: Algorithmic graph theory and perfect graphs
cites work: Parallel concepts in graph theory
DOI: 10.1016/J.DAM.2008.11.017
description: scientific article; zbMATH DE number 5569436