Neighbor sum distinguishing colorings of graphs with maximum average degree less than 37 12
In this paper, the authors investigate the neighbor sum distinguishing coloring of graphs, which is defined as a proper edge coloring such that for any edge \(uv\), the sum of colors assigned on incident edges of \(u\) is different from the sum of colors assigned on incident edges of \(v\). The smallest number of colors that a graph can have a neighbor sum distinguishing coloring with these colors is denoted by \(\chi^\prime_\Sigma(G)\). \textit{E. Flandrin} et al. [Graphs Comb. 29, No. 5, 1329--1336 (2013; Zbl 1272.05047)] conjectured that \(\chi^\prime_\Sigma(G)\leq \Delta(G)+2\) for any connected graph \(G\cong C_5\) with at least \(3\) vertices and maximum degree \(\Delta(G)\). In this paper, the authors verify this conjecture for a normal graph with the maximum degree at least \(7\) and maximum average degree less that \(37/12\).
- Neighbor sum distinguishing edge colorings of graphs with bounded maximum average degree
- Neighbor sum distinguishing edge colorings of graphs with small maximum average degree
- Neighbor sum distinguishing total colorings of graphs with bounded maximum average degree
- Neighbor sum distinguishing edge colorings of sparse graphs
- Neighbor sum distinguishing index of sparse graphs
- \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
- r-strong edge colorings of graphs
- 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
- Adjacent vertex-distinguishing edge coloring of graphs with maximum degree
- Adjacent vertex-distinguishing edge colorings of \(K_{4}\)-minor free 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
- Neighbor distinguishing edge colorings via the combinatorial Nullstellensatz
- Neighbor sum distinguishing coloring of some graphs
- Neighbor sum distinguishing edge coloring of subcubic graphs
- Neighbor sum distinguishing edge colorings of graphs with bounded maximum average degree
- Neighbor sum distinguishing edge colorings of graphs with small maximum average degree
- Neighbor sum distinguishing edge colorings of sparse 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
- On the neighbour-distinguishing index of a graph
- 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
- On the total neighbour sum distinguishing index of graphs with bounded maximum average degree
- Neighbor sum distinguishing total colorings of graphs with bounded maximum average degree
- Neighbor sum distinguishing edge colorings of graphs with bounded maximum average degree
- The neighbour sum distinguishing relaxed edge colouring
- Neighbor sum distinguishing total choosability of graphs with larger maximum average degree.
- Graphs with maximum degree 17 and maximum average degree less than 3 are list 2-distance ( +2)-colorable
- An improved upper bound for the neighbor sum distinguishing index of graphs
- scientific article; zbMATH DE number 7144820 (Why is no real title available?)
- On the neighbor sum-distinguishing vertex coloring of a graph
- Lower bounds and properties for the average number of colors in the non-equivalent colorings of a graph
- Neighbor Sum Distinguishing Total Chromatic Number of Graphs with Lower Average Degree
- An improved upper bound for neighbor sum distinguishing edge colorings of graphs
- Neighbor sum distinguishing edge colorings of graphs with small maximum average degree
This page was built for publication: Neighbor sum distinguishing colorings of graphs with maximum average degree less than \(\frac{37} {12}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q681756)
