Adjacent vertex distinguishing edge colorings of planar graphs with girth at least five

DOI10.1007/S10878-012-9569-5zbMath1337.90077OpenAlexW2011298123MaRDI QIDQ489739

Chengchao Yan, Danjun Huang, Dong Chen, Wei Fan Wang

Publication date: 21 January 2015

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

Full work available at URL: https://doi.org/10.1007/s10878-012-9569-5

zbMATH Keywords

girthplanar graphmaximum degreeadjacent vertex distinguishing edge coloring

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Coloring of graphs and hypergraphs (05C15)

Related Items (8)

Adjacent vertex distinguishing edge coloring of planar graphs without 4-cycles ⋮ Neighbor-distinguishing indices of planar graphs with maximum degree ten ⋮ Adjacent vertex distinguishing edge choosability of 1-planar graphs with maximum degree at least 23 ⋮ Upper bounds for adjacent vertex-distinguishing edge coloring ⋮ Adjacent vertex distinguishing indices of planar graphs without 3-cycles ⋮ Unnamed Item ⋮ Adjacent vertex distinguishing edge coloring of planar graphs without 3-cycles ⋮ Some bounds on the neighbor-distinguishing index of graphs

Cites Work

• Unnamed Item
• Adjacent vertex-distinguishing edge colorings of \(K_{4}\)-minor free graphs
• On the neighbour-distinguishing index of a graph
• Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree
• Adjacent strong edge coloring of graphs
• \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
• Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least six
• Adjacent Vertex Distinguishing Edge‐Colorings

This page was built for publication: Adjacent vertex distinguishing edge colorings of planar graphs with girth at least five