Efficient enumeration of non-isomorphic distance-hereditary graphs and related graphs (Q6184324)
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: Efficient enumeration of non-isomorphic distance-hereditary graphs and related graphs |
scientific article; zbMATH DE number 7794327
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient enumeration of non-isomorphic distance-hereditary graphs and related graphs |
scientific article; zbMATH DE number 7794327 |
Statements
Efficient enumeration of non-isomorphic distance-hereditary graphs and related graphs (English)
0 references
24 January 2024
0 references
\((6, 2)\)-chordal bipartite graph
0 references
distance-hereditary graph
0 references
enumeration
0 references
graph isomorphism
0 references
3-leaf power graph
0 references
Ptolemaic graph
0 references
0 references
