Neighbor sum distinguishing edge colorings of graphs with small maximum average degree
DOI10.1007/S40840-015-0207-0zbMATH Open1339.05133OpenAlexW2259574614MaRDI QIDQ726516FDOQ726516
Authors: Yuping Gao, Guanghui Wang, Jian-Liang Wu 
Publication date: 11 July 2016
Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40840-015-0207-0
Recommendations
- Neighbor sum distinguishing edge colorings of graphs with bounded maximum average degree
- Neighbor sum distinguishing colorings of graphs with maximum average degree less than \(\frac{37} {12}\)
- Neighbor sum distinguishing edge colorings of sparse graphs
- On the neighbour sum distinguishing index of graphs with bounded maximum average degree
- Neighbor sum distinguishing index
Extremal problems in graph theory (05C35) Vertex degrees (05C07) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Adjacent strong edge coloring of graphs
- Graph theory with applications
- Neighbor sum distinguishing index
- On the maximum average degree and the oriented chromatic number of a graph
- Total coloring of planar graphs without some chordal 6-cycles
- Neighbor sum distinguishing edge colorings of graphs with bounded maximum average degree
- Neighbor sum distinguishing coloring of some graphs
- \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
- Adjacent Vertex Distinguishing Edge‐Colorings
- \(r\)-strong edge colorings of graphs
- Total colorings of planar graphs with small maximum degree
- Adjacent vertex-distinguishing edge coloring of graphs with maximum degree at least five
- Adjacent vertex-distinguishing edge coloring of graphs with maximum degree \(\Delta\)
- 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 \(K_{4}\)-minor free graphs
- The linear arboricity of planar graphs without 5-, 6-cycles with chords
Cited In (12)
- 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 total coloring of graphs embedded in surfaces of nonnegative Euler characteristic
- Neighbor sum distinguishing edge colorings of sparse graphs
- Neighbor sum distinguishing index of sparse graphs
- Neighbor sum distinguishing chromatic index of sparse graphs via the combinatorial Nullstellensatz
- Neighbor sum distinguishing edge colorings of graphs with bounded maximum average degree
- The neighbour sum distinguishing relaxed edge colouring
- On the neighbour sum distinguishing index of graphs with bounded maximum average degree
- Title not available (Why is that?)
- Title not available (Why is that?)
- Neighbor sum distinguishing edge coloring of subcubic graphs
This page was built for publication: Neighbor sum distinguishing edge colorings of graphs with small maximum average degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q726516)
