Neighbor sum distinguishing edge coloring of subcubic graphs

DOI10.1007/S10114-017-5516-9MaRDI QIDQ523715zbMATH OpenOpenAlexFDO

Authors Xiaowei Yu, Jian-Liang Wu, Guanghui Wang, Guiying Yan

Publication date 21 April 2017

Published in Acta Mathematica Sinica, English Series (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10114-017-5516-9

zbMATH Keywords

planar graphsubcubic graphmaximum average degreeproper edge coloringneighbor sum distinguishing edge coloring

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Recommendations

• Neighbor sum distinguishing index of subcubic graphs
• Neighbor-sum-distinguishing edge choosability of subcubic graphs
• Neighbor sum distinguishing edge colorings of graphs with small maximum average degree
• Neighbor sum distinguishing index of sparse graphs
• Neighbor sum distinguishing edge colorings of graphs with bounded maximum average degree

Cites work

• Adjacent Vertex Distinguishing Edge‐Colorings
• Adjacent strong edge coloring of graphs
• Adjacent vertex distinguishing colorings by sum of sparse graphs
• An improved upper bound for the neighbor sum distinguishing index of graphs
• Asymptotically optimal neighbour sum distinguishing colourings of graphs
• Combinatorial Nullstellensatz
• Graph theory with applications
• Improved bounds for neighbor sum (set) distinguishing choosability of planar graphs
• Neighbor distinguishing edge colorings via the combinatorial Nullstellensatz
• Neighbor distinguishing edge colorings via the combinatorial Nullstellensatz revisited
• Neighbor sum distinguishing coloring of some graphs
• Neighbor sum distinguishing index
• Neighbor sum distinguishing index of planar graphs
• Neighbor sum distinguishing total colorings of planar graphs
• On Neighbor-Distinguishing Index of Planar Graphs
• On the neighbor sum distinguishing index of planar graphs
• \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number

Cited in

(10)

• Neighbor sum distinguishing colorings of graphs with maximum average degree less than \(\frac{37} {12}\)
• Neighbor sum distinguishing index of subcubic graphs
• Neighbor sum distinguishing edge colorings of sparse graphs
• Proper edge-colorings with a rich neighbor requirement
• Equitable neighbour-sum-distinguishing edge and total colourings
• Neighbor-sum-distinguishing edge choosability of subcubic graphs
• List neighbor sum distinguishing edge coloring of subcubic graphs
• The neighbour sum distinguishing relaxed edge colouring
• On the chromatic number of a family of odd hole free graphs
• scientific article; zbMATH DE number 6613818 (Why is no real title available?)

This page was built for publication: Neighbor sum distinguishing edge coloring of subcubic graphs

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