Concise proofs for adjacent vertex-distinguishing total colorings (Q1025519): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Vertex-distinguishing proper edge-colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the vertex-distinguishing proper edge-colorings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex distinguishing colorings of graphs with \(\Delta(G)=2\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjacent strong edge coloring of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On adjacent-vertex-distinguishing total coloring of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the adjacent vertex-distinguishing total chromatic numbers of the graphs with \(\Delta (G) = 3\) / rank
 
Normal rank

Revision as of 16:10, 1 July 2024

scientific article
Language Label Description Also known as
English
Concise proofs for adjacent vertex-distinguishing total colorings
scientific article

    Statements

    Concise proofs for adjacent vertex-distinguishing total colorings (English)
    0 references
    0 references
    19 June 2009
    0 references
    adjacent vertex-distinguishing total coloring
    0 references
    adjacent vertex-distinguishing total chromatic number
    0 references

    Identifiers