On the adjacent vertex-distinguishing total chromatic numbers of the graphs with \(\Delta (G) = 3\) (Q2460105)

From MaRDI portal
Revision as of 20:40, 4 August 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
On the adjacent vertex-distinguishing total chromatic numbers of the graphs with \(\Delta (G) = 3\)
scientific article

    Statements

    On the adjacent vertex-distinguishing total chromatic numbers of the graphs with \(\Delta (G) = 3\) (English)
    0 references
    0 references
    14 November 2007
    0 references
    adjacent vertex-distinguishing total coloring
    0 references
    adjacent vertex-distinguishing total chromatic number
    0 references
    subdivision vertex
    0 references
    subdivision graph
    0 references

    Identifiers