The computational complexity of the backbone coloring problem for bounded-degree graphs with connected backbones (Q477637)

From MaRDI portal
Revision as of 11:03, 9 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The computational complexity of the backbone coloring problem for bounded-degree graphs with connected backbones
scientific article

    Statements

    The computational complexity of the backbone coloring problem for bounded-degree graphs with connected backbones (English)
    0 references
    0 references
    0 references
    9 December 2014
    0 references
    bounded-degree graphs
    0 references
    backbone chromatic number
    0 references
    graph algorithms
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references