Neighbor sum distinguishing index of subcubic graphs (Q2014224): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: \(r\)-strong edge colorings of graphs / 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: On the Neighbor Sum Distinguishing Index of Planar Graphs / 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: On Neighbor-Distinguishing Index of Planar 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: Neighbor sum distinguishing index of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Characterization on the Adjacent Vertex Distinguishing Index of Planar Graphs with Large Maximum 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: Some bounds on the neighbor-distinguishing index of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjacent strong edge coloring of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph / rank
 
Normal rank

Latest revision as of 05:36, 14 July 2024

scientific article
Language Label Description Also known as
English
Neighbor sum distinguishing index of subcubic graphs
scientific article

    Statements

    Neighbor sum distinguishing index of subcubic graphs (English)
    0 references
    0 references
    0 references
    0 references
    10 August 2017
    0 references
    subcubic graphs
    0 references
    neighbor sum distinguishing edge coloring
    0 references
    combinatorial Nullstellensatz
    0 references

    Identifiers