The neighbour sum distinguishing relaxed edge colouring (Q2668336): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Combinatorial Nullstellensatz / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex-coloring edge-weightings of 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: Neighbor sum distinguishing edge colorings of graphs with small maximum average degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the neighbour sum distinguishing index of graphs with bounded maximum average degree / 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: Neighbor sum distinguishing index of subcubic graphs / 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: Edge weights and vertex colours / 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: A note on asymptotically optimal neighbour sum distinguishing colourings / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 1-2-3 conjecture almost holds for regular graphs / 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: Neighbor sum distinguishing colorings of graphs with maximum average degree less than \(\frac{37} {12}\) / 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: Adjacent vertex distinguishing colorings by sum of sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neighbor sum distinguishing edge coloring of subcubic graphs / rank
 
Normal rank

Latest revision as of 04:14, 28 July 2024

scientific article
Language Label Description Also known as
English
The neighbour sum distinguishing relaxed edge colouring
scientific article

    Statements

    The neighbour sum distinguishing relaxed edge colouring (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    3 March 2022
    0 references
    subcubic graphs
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references