Neighbor sum distinguishing total choosability of planar graphs without 4-cycles (Q277657)

From MaRDI portal
Revision as of 19:16, 19 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
Neighbor sum distinguishing total choosability of planar graphs without 4-cycles
scientific article

    Statements

    Neighbor sum distinguishing total choosability of planar graphs without 4-cycles (English)
    0 references
    0 references
    0 references
    0 references
    2 May 2016
    0 references

    Identifiers