Efficient enumeration of non-isomorphic distance-hereditary graphs and Ptolemaic graphs (Q2232254): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-030-68211-8_23 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3131940099 / rank | |||
Normal rank | |||
Revision as of 18:39, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient enumeration of non-isomorphic distance-hereditary graphs and Ptolemaic graphs |
scientific article |
Statements
Efficient enumeration of non-isomorphic distance-hereditary graphs and Ptolemaic graphs (English)
0 references
4 October 2021
0 references
distance-hereditary graph
0 references
enumeration
0 references
graph isomorphism
0 references
Ptolemaic graph
0 references
