Neighbor sum distinguishing edge coloring of subcubic graphs (Q523715): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Guang-Hui Wang / rank
Normal rank
 
Property / author
 
Property / author: Jian Liang Wu / rank
Normal rank
 
Property / author
 
Property / author: Gui Ying Yan / rank
Normal rank
 
Property / author
 
Property / author: Guang-Hui Wang / rank
Normal rank
 
Property / author
 
Property / author: Guang-Hui Wang / rank
 
Normal rank
Property / author
 
Property / author: Gui Ying Yan / 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.1007/s10114-017-5516-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2567995771 / 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: Q3097395 / 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 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: 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: Improved bounds for neighbor sum (set) distinguishing choosability 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 colorings by sum of sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjacent strong edge coloring of graphs / rank
 
Normal rank

Latest revision as of 17:53, 13 July 2024

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

    Statements

    Neighbor sum distinguishing edge coloring of subcubic graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    21 April 2017
    0 references
    0 references
    proper edge coloring
    0 references
    neighbor sum distinguishing edge coloring
    0 references
    maximum average degree
    0 references
    subcubic graph
    0 references
    planar graph
    0 references
    0 references