An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph (Q741759): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
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: Vertex‐distinguishing edge colorings of random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex distinguishing colorings of graphs with \(\Delta(G)=2\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjacent Vertex Distinguishing Edge‐Colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balanced edge colorings. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex-distinguishing edge colorings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the vertex-distinguishing proper edge-colorings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the vertex-distinguishing proper coloring of graphs with large minimum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex-distinguishing proper edge-colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4886768 / 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: 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: Q4865126 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex-distinguishing edge colorings of graphs with degree sum conditions / 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 strong edge coloring of graphs / rank
 
Normal rank

Latest revision as of 01:47, 9 July 2024

scientific article
Language Label Description Also known as
English
An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph
scientific article

    Statements

    An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph (English)
    0 references
    0 references
    0 references
    0 references
    12 September 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    adjacent vertex distinguishing coloring
    0 references
    maximum degree
    0 references
    edge-partition
    0 references
    0 references
    0 references