Neighbor sum distinguishing edge colorings of sparse graphs

DOI10.1016/J.DAM.2015.04.018MaRDI QIDQ2355754zbMATH OpenOpenAlexFDO

Authors Xiaolan Hu, Yaojun Chen, Rong Luo, Zhengke Miao

Publication date 24 July 2015

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2015.04.018

zbMATH Keywords

maximum degreemaximum average degreeneighbor sum distinguishing edge coloringsproper edge colorings

Mathematics Subject Classification ID

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

Recommendations

• Neighbor sum distinguishing total coloring of a kind of sparse graph.
• Neighbor sum distinguishing coloring of some graphs
• Adjacent vertex distinguishing colorings by sum of sparse graphs
• Neighbor sum distinguishing edge coloring of subcubic graphs
• On the neighbor sum-distinguishing vertex coloring of a graph
• Neighbor sum distinguishing edge colorings of graphs with small maximum average degree
• Neighbor sum distinguishing edge colorings of graphs with bounded maximum average degree
• Neighbor sum distinguishing edge coloring of the join of paths
• Neighbor sum distinguishing total coloring of sparse IC-planar graphs
• scientific article; zbMATH DE number 6613818

Cites work

• Adjacent Vertex Distinguishing Edge‐Colorings
• Adjacent strong edge coloring of graphs
• Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree
• Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least six
• Adjacent vertex-distinguishing edge colorings of \(K_{4}\)-minor free graphs
• Asymptotically optimal neighbour sum distinguishing colourings of graphs
• Neighbor distinguishing edge colorings via the combinatorial Nullstellensatz
• Neighbor distinguishing edge colorings via the combinatorial Nullstellensatz revisited
• Neighbor sum distinguishing edge colorings of graphs with bounded maximum average degree
• Neighbor sum distinguishing index
• Neighbor sum distinguishing index of planar graphs
• On Neighbor-Distinguishing Index of Planar Graphs
• On the neighbor sum distinguishing index of planar graphs
• On the neighbour-distinguishing index of a graph
• \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
• \(r\)-strong edge colorings of graphs

Cited in

(18)

• Neighbor sum distinguishing index of sparse graphs
• Neighbor sum distinguishing colorings of graphs with maximum average degree less than \(\frac{37} {12}\)
• The adjacent vertex distinguishing edge choosability of planar graphs with maximum degree at least 11
• On the neighbour sum distinguishing index of graphs with bounded maximum average degree
• List neighbor sum distinguishing edge coloring of subcubic graphs
• Neighbor sum distinguishing total coloring of a kind of sparse graph.
• Asymptotically optimal neighbour sum distinguishing colourings of graphs
• Neighbor sum distinguishing edge colorings of graphs with small maximum average degree
• Neighbor sum distinguishing coloring of some graphs
• Neighbor sum distinguishing chromatic index of sparse graphs via the combinatorial Nullstellensatz
• The neighbour sum distinguishing relaxed edge colouring
• scientific article; zbMATH DE number 6613818 (Why is no real title available?)
• Neighbour-distinguishing edge colourings of random regular graphs
• A note on asymptotically optimal neighbour sum distinguishing colourings
• Adjacent vertex distinguishing colorings by sum of sparse graphs
• Neighbor sum distinguishing edge colorings of graphs with bounded maximum average degree
• Neighbor sum distinguishing index of 2-degenerate graphs
• Neighbor sum distinguishing index of a kind of sparse graphs

This page was built for publication: Neighbor sum distinguishing edge colorings of sparse graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2355754)