A tight upper bound on the (\(2,1\))-total labeling number of outerplanar graphs (Q450562)

From MaRDI portal
Revision as of 17:20, 21 June 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 tight upper bound on the (\(2,1\))-total labeling number of outerplanar graphs
scientific article

    Statements

    A tight upper bound on the (\(2,1\))-total labeling number of outerplanar graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    13 September 2012
    0 references

    Identifiers