The complexity of the \(L(p,q)\)-labeling problem for bipartite planar graphs of small degree (Q1025950)

From MaRDI portal
Revision as of 07:38, 11 July 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
The complexity of the \(L(p,q)\)-labeling problem for bipartite planar graphs of small degree
scientific article

    Statements

    The complexity of the \(L(p,q)\)-labeling problem for bipartite planar graphs of small degree (English)
    0 references
    0 references
    0 references
    0 references
    23 June 2009
    0 references
    \(L(p, q)\)-labeling
    0 references
    graphs of small degree
    0 references
    bipartite graphs
    0 references
    planar graphs
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references