On the adjacent-vertex-strongly-distinguishing total coloring of graphs (Q931507): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11425-007-0128-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2255720106 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex-distinguishing proper edge-colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong 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: On adjacent-vertex-distinguishing total coloring of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjacent strong edge coloring of graphs / rank
 
Normal rank

Latest revision as of 11:41, 28 June 2024

scientific article
Language Label Description Also known as
English
On the adjacent-vertex-strongly-distinguishing total coloring of graphs
scientific article

    Statements

    On the adjacent-vertex-strongly-distinguishing total coloring of graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    25 June 2008
    0 references
    simple connected graph
    0 references
    proper coloring
    0 references
    adjacent-vertex-strongly-distinguishing total coloring
    0 references
    avsdt coloring
    0 references

    Identifiers