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

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Guang-Hui Wang / rank
 
Normal rank
Property / author
 
Property / author: Jiang-Hua Zhang / 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.1016/j.dam.2013.10.009 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2001221074 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex-colouring edge-weightings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree constrained subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(r\)-strong edge colorings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjacent Vertex Distinguishing Edge‐Colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least six / 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: On the neighbour-distinguishing index of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neighbor sum distinguishing index / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex-coloring edge-weightings: towards the 1-2-3-conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge weights and vertex colours / 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: Neighbor Distinguishing Edge Colorings via the Combinatorial Nullstellensatz / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neighbor sum distinguishing index of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjacent vertex-distinguishing edge colorings of \(K_{4}\)-minor free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved upper bound for the neighbor sum distinguishing index of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On vertex-coloring 13-edge-weighting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjacent strong edge coloring of graphs / rank
 
Normal rank

Latest revision as of 09:19, 7 July 2024

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

    Statements

    Neighbor sum distinguishing edge colorings of graphs with bounded maximum average degree (English)
    0 references
    0 references
    0 references
    0 references
    18 February 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    proper colorings
    0 references
    neighbor sum distinguishing edge colorings
    0 references
    maximum average degree
    0 references
    0 references