Neighbor sum distinguishing edge colorings of graphs with small maximum average degree (Q726516): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Yu-ping Gao / rank
Normal rank
 
Property / author
 
Property / author: Guang-Hui Wang / rank
Normal rank
 
Property / author
 
Property / author: Jian Liang Wu / rank
Normal rank
 
Property / author
 
Property / author: Yu-ping Gao / rank
 
Normal rank
Property / author
 
Property / author: Guang-Hui Wang / rank
 
Normal rank
Property / author
 
Property / author: Jian Liang Wu / 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/s40840-015-0207-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2259574614 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjacent strong edge coloring 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: \(r\)-strong edge colorings 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: 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 index / 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: The linear arboricity of planar graphs without 5-, 6-cycles with chords / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total colorings of planar graphs with small maximum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total coloring of planar graphs without some chordal 6-cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximum average degree and the oriented chromatic number of a graph / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 07:48, 12 July 2024

scientific article
Language Label Description Also known as
English
Neighbor sum distinguishing edge colorings of graphs with small maximum average degree
scientific article

    Statements

    Neighbor sum distinguishing edge colorings of graphs with small maximum average degree (English)
    0 references
    11 July 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    proper edge coloring
    0 references
    neighbor sum distinguishing edge coloring
    0 references
    maximum average degree
    0 references
    0 references
    0 references
    0 references
    0 references