The adjacent vertex distinguishing edge choosability of planar graphs with maximum degree at least 11

DOI10.1016/J.DAM.2022.01.003zbMath1485.05054OpenAlexW4213417247MaRDI QIDQ832991

Bin Wang, Xiaohan Cheng, Ji Hui Wang

Publication date: 28 March 2022

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

Full work available at URL: https://doi.org/10.1016/j.dam.2022.01.003

zbMATH Keywords

planar graphmaximum degreeadjacent vertex distinguishing edge choosability

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)

Related Items (2)

Neighbor-distinguishing indices of planar graphs with maximum degree ten ⋮ Adjacent vertex distinguishing edge choosability of 1-planar graphs with maximum degree at least 23

Cites Work

• Unnamed Item
• Neighbor sum distinguishing index
• Neighbor sum distinguishing index of planar graphs
• An improved upper bound for the neighbor sum distinguishing index of graphs
• Neighbor sum distinguishing edge colorings of graphs with small maximum average degree
• \(r\)-strong edge colorings of graphs
• Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree
• Adjacent strong edge coloring of graphs
• A note on asymptotically optimal neighbour sum distinguishing colourings
• The polynomial method and restricted sums of congruence classes
• Improved bounds for neighbor sum (set) distinguishing choosability of planar graphs
• Neighbor sum distinguishing edge colorings of sparse graphs
• \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
• Neighbor sum distinguishing edge colorings of graphs with bounded maximum average degree
• Neighbor Distinguishing Edge Colorings via the Combinatorial Nullstellensatz
• Asymptotically optimal neighbour sum distinguishing colourings of graphs
• NEIGHBOR SUM DISTINGUISHING COLORING OF SOME GRAPHS
• On the Neighbor Sum Distinguishing Index of Planar Graphs
• Asymptotically optimal bound on the adjacent vertex distinguishing edge choice number
• Adjacent Vertex Distinguishing Edge‐Colorings
• On Neighbor-Distinguishing Index of Planar Graphs

This page was built for publication: The adjacent vertex distinguishing edge choosability of planar graphs with maximum degree at least 11