A fast algorithm for the product structure of planar graphs (Q2663717)

From MaRDI portal
Revision as of 02:26, 7 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    0 references
    19 April 2021
    0 references
    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