Recognizing clique graphs of directed and rooted path graphs (Q1293208)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Recognizing clique graphs of directed and rooted path graphs |
scientific article; zbMATH DE number 1309396
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Recognizing clique graphs of directed and rooted path graphs |
scientific article; zbMATH DE number 1309396 |
Statements
Recognizing clique graphs of directed and rooted path graphs (English)
0 references
5 December 1999
0 references
characterizations
0 references
clique graphs
0 references
path graphs
0 references
strongly chordal graphs
0 references
polynomial time algorithms
0 references
0 references
0.9011315
0 references
0.89787066
0 references
0 references
0.8812851
0 references
0.87588716
0 references
