Building a maximal independent set for the vertex-coloring problem on planar graphs (Q2133444)

From MaRDI portal
Revision as of 08:50, 12 February 2024 by RedirectionBot (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
Building a maximal independent set for the vertex-coloring problem on planar graphs
scientific article

    Statements

    Building a maximal independent set for the vertex-coloring problem on planar graphs (English)
    0 references
    29 April 2022
    0 references
    0 references
    planar graphs
    0 references
    vertex coloring
    0 references
    wheel graphs
    0 references
    polyhedral wheel graphs
    0 references
    maximal independent set
    0 references
    0 references