On generalized neighbor sum distinguishing index of planar graphs

DOI10.1142/S1793830921501470zbMath1489.05054MaRDI QIDQ5083874

Jieru Feng, Yue Wang, Jian Liang Wu

Publication date: 21 June 2022

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

zbMATH Keywords

edge coloringplanar graphneighbor sum distinguishing edge coloring

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Neighbor sum distinguishing index
• Neighbor sum distinguishing index of planar graphs
• \(r\)-strong edge colorings of graphs
• List \(r\)-dynamic coloring of graphs with small maximum average degree
• An improved bound on acyclic chromatic index of planar graphs
• Distant sum distinguishing index of graphs
• Improved bounds for neighbor sum (set) distinguishing choosability of planar graphs
• A note of vertex arboricity of planar graphs without 4-cycles intersecting with 6-cycles
• Neighbor Distinguishing Edge Colorings via the Combinatorial Nullstellensatz
• Neighbor Distinguishing Edge Colorings Via the Combinatorial Nullstellensatz Revisited
• Combinatorial Nullstellensatz
• NEIGHBOR SUM DISTINGUISHING COLORING OF SOME GRAPHS
• On the Neighbor Sum Distinguishing Index of Planar Graphs
• Adjacent Vertex Distinguishing Edge‐Colorings

This page was built for publication: On generalized neighbor sum distinguishing index of planar graphs