Adjacent vertex distinguishing edge coloring of IC-planar graphs

DOI10.1007/s10878-021-00807-0zbMath1492.05047OpenAlexW3201589777MaRDI QIDQ2136165

Changqing Xu, Zhuoya Liu

Publication date: 10 May 2022

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-021-00807-0

zbMATH Keywords

discharging methodadjacent vertex distinguishing edge coloringIC-planar graph

Mathematics Subject Classification ID

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

Related Items (1)

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

Cites Work

• Adjacent strong edge coloring of graphs
• On edge colorings of \(1\)-planar graphs
• A Characterization on the Adjacent Vertex Distinguishing Index of Planar Graphs with Large Maximum Degree
• Chromatic number, independence ratio, and crossing number
• Adjacent Vertex Distinguishing Edge‐Colorings
• On Neighbor-Distinguishing Index of Planar Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Adjacent vertex distinguishing edge coloring of IC-planar graphs