Recognizing clique graphs of directed and rooted path graphs
type: Item
instance of: scholarly article
title: Recognizing clique graphs of directed and rooted path graphs
zbMATH Open document ID: 0927.05071
DOI: 10.1016/S0166-218X(99)00028-1
published in: Discrete Applied Mathematics
publication date: 1999-12-05T00:00:00Z
Mathematics Subject Classification ID: 05C75
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 1309396
zbMATH Keywords: characterizations
zbMATH Keywords: clique graphs
zbMATH Keywords: path graphs
zbMATH Keywords: strongly chordal graphs
zbMATH Keywords: polynomial time algorithms
author: Erich Prisner
author: Jayme L. Szwarcfiter
MaRDI profile type: Publication
cites work: Clique graphs and Helly graphs
cites work: Dually Chordal Graphs
cites work: A characterisation of rigid circuit graphs
cites work: Matrix multiplication via arithmetic progressions
cites work: Über iterierte Clique-Graphen
cites work: Domination, independent domination, and duality in strongly chordal graphs
cites work: The intersection graphs of subtrees in trees are exactly the chordal graphs
cites work: A recognition algorithm for the intersection graphs of directed paths in directed trees
cites work: Q3328583
cites work: Intersection graphs of paths in a tree
cites work: Q4867717
cites work: Q4940014
cites work: Clique Graphs of Chordal and Path Graphs
cites work: A New Algorithm for Generating All the Maximal Independent Sets
Recommended article: Q4940014
Recommended article: Recognizing Helly edge-path-tree graphs and their clique graphs
Recommended article: The complexity of clique graph recognition
Recommended article: Recognizing \(k\)-path graphs
Recommended article: Q5461523
Recommended article: Q4731206
Recommended article: Clique Graphs of Chordal and Path Graphs
Recommended article: Q4810372
Recommended article: Clique Graph Recognition Is NP-Complete
description: scientific article; zbMATH DE number 1309396