Neighbor sum distinguishing edge colorings of graphs with small maximum average degree

DOI10.1007/s40840-015-0207-0zbMath1339.05133OpenAlexW2259574614MaRDI QIDQ726516

Jian Liang Wu, Yu-ping Gao, Guang-Hui Wang

Publication date: 11 July 2016

Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40840-015-0207-0

zbMATH Keywords

maximum average degreeproper edge coloringneighbor sum distinguishing edge coloring

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)

Related Items (7)

Neighbor sum distinguishing total coloring of graphs embedded in surfaces of nonnegative Euler characteristic ⋮ The adjacent vertex distinguishing edge choosability of planar graphs with maximum degree at least 11 ⋮ The neighbour sum distinguishing relaxed edge colouring ⋮ Neighbor sum distinguishing index of sparse graphs ⋮ On the neighbour sum distinguishing index of graphs with bounded maximum average degree ⋮ Neighbor sum distinguishing chromatic index of sparse graphs via the combinatorial Nullstellensatz ⋮ Neighbor sum distinguishing colorings of graphs with maximum average degree less than \(\frac{37} {12}\)

Cites Work

• Unnamed Item
• Unnamed Item
• Adjacent vertex-distinguishing edge coloring of graphs with maximum degree \(\Delta\)
• Total colorings of planar graphs with small maximum degree
• Neighbor sum distinguishing index
• Adjacent vertex-distinguishing edge colorings of \(K_{4}\)-minor free graphs
• On the neighbour-distinguishing index of a graph
• \(r\)-strong edge colorings of graphs
• Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree
• On the maximum average degree and the oriented chromatic number of a graph
• Adjacent strong edge coloring of graphs
• Total coloring of planar graphs without some chordal 6-cycles
• The linear arboricity of planar graphs without 5-, 6-cycles with chords
• \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
• Neighbor sum distinguishing edge colorings of graphs with bounded maximum average degree
• NEIGHBOR SUM DISTINGUISHING COLORING OF SOME GRAPHS
• Adjacent Vertex Distinguishing Edge‐Colorings

This page was built for publication: Neighbor sum distinguishing edge colorings of graphs with small maximum average degree