Recognizing hole-free 4-map graphs in cubic time (Q2498931): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s00453-005-1184-8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2037591624 / rank | |||
Normal rank | |||
Latest revision as of 00:33, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Recognizing hole-free 4-map graphs in cubic time |
scientific article |
Statements
Recognizing hole-free 4-map graphs in cubic time (English)
0 references
11 August 2006
0 references
planar graphs
0 references
maps
0 references
map graphs
0 references
cliques
0 references
graph algorithms
0 references
