Neighbor sum distinguishing total colorings of graphs with bounded maximum average degree (Q2452418): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Guang-Hui Wang / rank
Normal rank
 
Property / author
 
Property / author: Guang-Hui Wang / rank
 
Normal rank
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/s10114-014-2454-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2057166029 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new upper bound for the total vertex irregularity strength of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On irregular total labellings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the adjacent vertex distinguishing total coloring numbers of graphs with \(\varDelta =3\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: NEIGHBOR SUM DISTINGUISHING COLORING OF SOME GRAPHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neighbor sum distinguishing index / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neighbor sum distinguishing total colorings of \(K_4\)-minor free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the total vertex irregularity strength of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the total-neighbor-distinguishing index by sums / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Bound on the Irregularity Strength and the Total Vertex Irregularity Strength 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
Property / cites work
 
Property / cites work: Q3011715 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjacent vertex distinguishing total coloring of graphs with lower average degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjacent vertex distinguishing total colorings of outerplanar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5488283 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On adjacent-vertex-distinguishing total coloring of graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:18, 8 July 2024

scientific article
Language Label Description Also known as
English
Neighbor sum distinguishing total colorings of graphs with bounded maximum average degree
scientific article

    Statements

    Neighbor sum distinguishing total colorings of graphs with bounded maximum average degree (English)
    0 references
    0 references
    0 references
    3 June 2014
    0 references
    0 references
    total coloring
    0 references
    neighbor sum
    0 references
    average degree
    0 references
    0 references