A fast algorithm for the product structure of planar graphs (Q2663717): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 11:48, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fast algorithm for the product structure of planar graphs |
scientific article |
Statements
A fast algorithm for the product structure of planar graphs (English)
0 references
19 April 2021
0 references
planar graphs
0 references
product structure
0 references
queue number
0 references
nonrepetitive colouring
0 references
adjacency labelling
0 references
p-centered colouring
0 references
