Neighbor sum distinguishing edge colorings of sparse graphs
From MaRDI portal
Publication:2355754
DOI10.1016/J.DAM.2015.04.018zbMATH Open1316.05045OpenAlexW261688557MaRDI QIDQ2355754FDOQ2355754
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
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
Extremal problems in graph theory (05C35) Vertex degrees (05C07) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Adjacent strong edge coloring of graphs
- Neighbor distinguishing edge colorings via the combinatorial Nullstellensatz
- Neighbor sum distinguishing index
- Neighbor sum distinguishing edge colorings of graphs with bounded maximum average degree
- Neighbor sum distinguishing index of planar graphs
- \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
- Neighbor distinguishing edge colorings via the combinatorial Nullstellensatz revisited
- Adjacent Vertex Distinguishing Edge‐Colorings
- On Neighbor-Distinguishing Index of Planar Graphs
- \(r\)-strong edge colorings of graphs
- Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree
- On the neighbour-distinguishing index of a graph
- 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
- On the neighbor sum distinguishing index of planar graphs
Cited In (18)
- Neighbour-distinguishing edge colourings of random regular 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
- Neighbor sum distinguishing index of 2-degenerate graphs
- Neighbor sum distinguishing index of sparse graphs
- A note on asymptotically optimal neighbour sum distinguishing colourings
- Neighbor sum distinguishing edge colorings of graphs with small maximum average degree
- Neighbor sum distinguishing total coloring of a kind of sparse graph.
- Asymptotically optimal neighbour sum distinguishing colourings of graphs
- Neighbor sum distinguishing coloring of some graphs
- Neighbor sum distinguishing chromatic index of sparse graphs via the combinatorial Nullstellensatz
- Neighbor sum distinguishing index of a kind of sparse graphs
- Neighbor sum distinguishing edge colorings of graphs with bounded maximum average degree
- List neighbor sum distinguishing edge coloring of subcubic graphs
- The neighbour sum distinguishing relaxed edge colouring
- Adjacent vertex distinguishing colorings by sum of sparse graphs
- On the neighbour sum distinguishing index of graphs with bounded maximum average degree
- Title not available (Why is that?)
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)
