Adjacent vertex distinguishing colorings by sum of sparse graphs

DOI10.1016/J.DISC.2015.07.011MaRDI QIDQ501028zbMATH OpenOpenAlexFDO

Authors Xiaowei Yu, Cun-quan Qu, Guanghui Wang, Yiqiao Wang

Publication date 8 October 2015

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2015.07.011

zbMATH Keywords

combinatorial nullstellensatzmaximum average degreeproper edge coloringneighbor sum distinguishing edge coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Density (toughness, etc.) (05C42)

Recommendations

• Neighbor sum distinguishing edge colorings of sparse graphs
• Adjacent vertex distinguishing total colorings of graphs with smaller degrees
• Adjacent vertex distinguishing total coloring in split graphs
• On adjacent-vertex-distinguishing total coloring of graphs
• Adjacent vertex-distinguishing total colorings of graphs with constraint conditions
• A note on adjacent vertex distinguishing colorings of graphs
• Adjacent vertex-distinguishing edge coloring of graphs
• On the adjacent vertex distinguishing edge colourings of graphs
• Vertex-edge adjacent vertex-distinguishing total colorings of some graphs

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 coloring of graphs with maximum degree
• Adjacent vertex-distinguishing edge coloring of graphs with maximum degree at least five
• An improved upper bound for the neighbor sum distinguishing index of graphs
• Asymptotically optimal neighbour sum distinguishing colourings of graphs
• Combinatorial Nullstellensatz
• Edge weights and vertex colours
• Graph theory with applications
• Neighbor distinguishing edge colorings via the combinatorial Nullstellensatz
• Neighbor sum distinguishing edge colorings of graphs with bounded maximum average degree
• Neighbor sum distinguishing index
• Neighbor sum 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

(11)

• On the algorithmic complexity of determining the AVD and NSD chromatic indices of graphs
• Neighbor sum distinguishing edge colorings of sparse graphs
• Neighbor sum distinguishing index of sparse graphs
• An improved upper bound for neighbor sum distinguishing edge colorings of graphs
• A note on asymptotically optimal neighbour sum distinguishing colourings
• Adjacent vertex distinguishing edge choosability of 1-planar graphs with maximum degree at least 23
• Neighbor sum distinguishing chromatic index of sparse graphs via the combinatorial Nullstellensatz
• The neighbour sum distinguishing relaxed edge colouring
• On the neighbour sum distinguishing index of graphs with bounded maximum average degree
• Upper bounds for adjacent vertex-distinguishing edge coloring
• Neighbor sum distinguishing edge coloring of subcubic graphs

This page was built for publication: Adjacent vertex distinguishing colorings by sum of sparse graphs

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