Adjacent-vertex-distinguishing proper edge colorings of planar bipartite graphs with \(\Delta=9\), \(10\), or \(11\)

DOI10.1016/j.ipl.2014.09.025zbMath1304.05023OpenAlexW2027629310MaRDI QIDQ477654

Zepeng Li, Xiang'en Chen

Publication date: 9 December 2014

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2014.09.025

zbMATH Keywords

combinatorial problemsplanar bipartite graphsadjacent-vertex-distinguishing proper edge chromatic numberadjacent-vertex-distinguishing proper edge coloring

Mathematics Subject Classification ID

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

Related Items (2)

AVD proper edge-coloring of some families of graphs ⋮ Upper bounds for adjacent vertex-distinguishing edge coloring

Cites Work

• Unnamed Item
• On the neighbour-distinguishing index of a graph
• On the vertex-distinguishing proper edge-colorings of graphs
• Adjacent strong edge coloring of graphs
• Vertex distinguishing colorings of graphs with \(\Delta(G)=2\)
• Adjacent Vertex Distinguishing Edge‐Colorings

This page was built for publication: Adjacent-vertex-distinguishing proper edge colorings of planar bipartite graphs with \(\Delta=9\), \(10\), or \(11\)