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

DOI10.1016/J.DAM.2022.01.003zbMATH Open1485.05054OpenAlexW4213417247MaRDI QIDQ832991FDOQ832991

Bin Wang, Jihui Wang, Xiaohan Cheng

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

Recommendations

• Adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least 10
• Adjacent vertex distinguishing edge choosability of 1-planar graphs with maximum degree at least 23
• The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven
• A characterization on the adjacent vertex distinguishing index of planar graphs with large maximum degree
• Adjacent vertex distinguishing edge colorings of planar graphs with girth at least five

zbMATH Keywords

maximum degreeplanar graphadjacent vertex distinguishing edge choosability

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) 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
• Title not available (Why is that?)
• Neighbor sum distinguishing index
• Neighbor sum distinguishing edge colorings of graphs with bounded maximum average degree
• Neighbor sum distinguishing index of planar graphs
• An improved upper bound for the neighbor sum distinguishing index of graphs
• NEIGHBOR SUM DISTINGUISHING COLORING OF SOME GRAPHS
• Neighbor sum distinguishing edge colorings of graphs with small maximum average degree
• \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
• Adjacent Vertex Distinguishing Edge‐Colorings
• On Neighbor-Distinguishing Index of Planar Graphs
• \(r\)-strong edge colorings of graphs
• The polynomial method and restricted sums of congruence classes
• Improved bounds for neighbor sum (set) distinguishing choosability of planar graphs
• Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree
• Neighbor sum distinguishing edge colorings of sparse graphs
• Asymptotically optimal neighbour sum distinguishing colourings of graphs
• On the Neighbor Sum Distinguishing Index of Planar Graphs
• A note on asymptotically optimal neighbour sum distinguishing colourings
• Asymptotically optimal bound on the adjacent vertex distinguishing edge choice number

Cited In (2)

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

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

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