On the neighbor-distinguishing indices of planar graphs

DOI10.1007/s40840-021-01213-9zbMath1485.05069OpenAlexW3216262375MaRDI QIDQ2117565

Jingjing Huo, Wenjing Xia, Yi Qiao Wang, Wei Fan Wang

Publication date: 21 March 2022

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-021-01213-9

zbMATH Keywords

planar graphmaximum degreedischarging methodneighbor-distinguishing edge coloring

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 ⋮ Local neighbor-distinguishing index of graphs

Cites Work

• Unnamed Item
• An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph
• \(r\)-strong edge colorings of graphs
• Adjacent strong edge coloring of graphs
• Some bounds on the neighbor-distinguishing index of graphs
• Edge-partitions of graphs and their neighbor-distinguishing index
• \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
• A Characterization on the Adjacent Vertex Distinguishing Index of Planar Graphs with Large Maximum Degree
• Progress on the Adjacent Vertex Distinguishing Edge Coloring Conjecture
• Adjacent Vertex Distinguishing Edge‐Colorings
• On Neighbor-Distinguishing Index of Planar Graphs

This page was built for publication: On the neighbor-distinguishing indices of planar graphs