Some bounds on the neighbor-distinguishing index of graphs (Q2352066): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Yi Qiao Wang / rank
Normal rank
 
Property / author
 
Property / author: Wei Fan Wang / rank
Normal rank
 
Property / author
 
Property / author: Yi Qiao Wang / rank
 
Normal rank
Property / author
 
Property / author: Wei Fan Wang / 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.1016/j.disc.2015.05.007 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W640218892 / 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: On the neighbour-distinguishing index of a graph / 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: On Neighbor-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: 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 edge colorings of planar graphs with girth at least five / 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 11:15, 10 July 2024

scientific article
Language Label Description Also known as
English
Some bounds on the neighbor-distinguishing index of graphs
scientific article

    Statements

    Some bounds on the neighbor-distinguishing index of graphs (English)
    0 references
    0 references
    0 references
    0 references
    29 June 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    neighbor-distinguishing edge coloring
    0 references
    maximum degree
    0 references
    edge-partition
    0 references
    0 references