Neighbor sum distinguishing chromatic index of sparse graphs via the combinatorial Nullstellensatz (Q1709430): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10255-018-0731-4 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Combinatorial Nullstellensatz / 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: Q3097395 / 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 COLORING OF SOME 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: 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: 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: Q2857387 / 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: Neighbor sum distinguishing total colorings 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: An improved upper bound for the neighbor sum distinguishing index of 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: 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
Property / Wikidata QID
 
Property / Wikidata QID: Q130186102 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10255-018-0731-4 / rank
 
Normal rank

Latest revision as of 05:13, 11 December 2024

scientific article
Language Label Description Also known as
English
Neighbor sum distinguishing chromatic index of sparse graphs via the combinatorial Nullstellensatz
scientific article

    Statements

    Neighbor sum distinguishing chromatic index of sparse graphs via the combinatorial Nullstellensatz (English)
    0 references
    0 references
    0 references
    0 references
    5 April 2018
    0 references
    proper edge coloring
    0 references
    neighbor sum distinguishing edge coloring
    0 references
    maximum average degree
    0 references
    combinatorial Nullstellensatz
    0 references
    0 references
    0 references

    Identifiers

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