On the neighbour sum distinguishing index of graphs with bounded maximum average degree (Q1696532): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
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: Irregular Assignments of Trees and Forests / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Nullstellensatz / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjacent Vertex Distinguishing Edge‐Colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5419983 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Neighbor Sum Distinguishing Index of Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Define an Irregular Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3824455 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Neighbor-Distinguishing Index of Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Irregularity strength of dense graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neighbor sum distinguishing edge colorings of graphs with bounded maximum average degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neighbor sum distinguishing index / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graph irregularity strength / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neighbor sum distinguishing edge colorings of graphs with small maximum average degree / 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: Adjacent vertex-distinguishing edge coloring of graphs with maximum degree \(\Delta\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neighbor sum distinguishing edge colorings of sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4873220 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Upper Bound for the Irregularity Strength of Graphs / 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: Q4873753 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Irregularity Strength of Dense Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tight Bound on the Irregularity Strength of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotically optimal neighbour sum distinguishing colourings of 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 Distinguishing Edge Colorings Via the Combinatorial Nullstellensatz Revisited / 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: 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 vertex distinguishing colorings by sum of sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjacent strong edge coloring of graphs / rank
 
Normal rank

Revision as of 03:11, 15 July 2024

scientific article
Language Label Description Also known as
English
On the neighbour sum distinguishing index of graphs with bounded maximum average degree
scientific article

    Statements

    On the neighbour sum distinguishing index of graphs with bounded maximum average degree (English)
    0 references
    0 references
    0 references
    14 February 2018
    0 references
    neighbour sum distinguishing index
    0 references
    maximum average degree
    0 references
    discharging method
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references