Improved bounds for neighbor sum (set) distinguishing choosability of planar graphs

DOI10.1016/J.DISC.2020.111856zbMATH Open1440.05083OpenAlexW3007656265MaRDI QIDQ2182186FDOQ2182186

Authors: Xiaohan Cheng, Lai-hao Ding, Guanghui Wang, Jian-Liang Wu 

Publication date: 21 May 2020

Published in: Discrete Mathematics (Search for Journal in Brave)

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

Recommendations

• Neighbor sum distinguishing index of planar graphs
• Neighbor sum distinguishing coloring of some graphs
• Neighbor distinguishing edge colorings via the combinatorial Nullstellensatz revisited
• On the neighbor sum distinguishing index of planar graphs
• On generalized neighbor sum distinguishing index of planar graphs

zbMATH Keywords

list coloringplanar graphcombinatorial nullstellensatzneighbor sum distinguishing coloringadjacent vertex distinguishing coloring

Mathematics Subject Classification ID

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

Cites Work

• Graph theory
• Adjacent strong edge coloring of graphs
• Edge weights and vertex colours
• Neighbor distinguishing edge colorings via the combinatorial Nullstellensatz
• Neighbor sum distinguishing index
• Neighbor sum distinguishing total colorings of planar graphs with maximum degree \(\varDelta\)
• Neighbor sum (set) distinguishing total choosability via the combinatorial Nullstellensatz
• Neighbor sum distinguishing index of planar graphs
• An improved upper bound for the neighbor sum distinguishing index of graphs
• Combinatorial Nullstellensatz
• Neighbor sum distinguishing total colorings via the combinatorial nullstellensatz
• Neighbor sum distinguishing coloring of some graphs
• On the neighbor sum distinguishing total coloring of planar graphs
• \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
• Neighbor sum distinguishing total choosability of planar graphs
• 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
• The number of edge 3-colorings of a planar cubic graph as a permanent
• Adjacent vertex-distinguishing edge coloring of graphs with maximum degree \(\Delta\)
• Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree
• Asymptotically optimal neighbour sum distinguishing colourings of graphs
• On the neighbor sum distinguishing index of planar graphs
• The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven
• A note on asymptotically optimal neighbour sum distinguishing colourings
• Asymptotically optimal neighbor sum distinguishing total colorings of graphs

Cited In (11)

• \mbox{\boldmath $\Delta=3$} 的图的邻和可区别全可选性
• The adjacent vertex distinguishing edge choosability of planar graphs with maximum degree at least 11
• An improved upper bound for neighbor sum distinguishing edge colorings of graphs
• Neighbor sum distinguishing index of planar graphs
• Neighbor sum distinguishing total choosability of planar graphs
• Adjacent vertex distinguishing edge choosability of 1-planar graphs with maximum degree at least 23
• Neighbor distinguishing edge colorings via the combinatorial Nullstellensatz revisited
• Neighbor sum distinguishing total coloring of planar graphs without 4-cycles
• On generalized neighbor sum distinguishing index of planar graphs
• Neighbor sum (set) distinguishing total choosability of \(d\)-degenerate graphs
• Neighbor sum distinguishing edge coloring of subcubic graphs

This page was built for publication: Improved bounds for neighbor sum (set) distinguishing choosability of planar graphs

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