Adjacent vertex-distinguishing edge coloring of 2-degenerate graphs

DOI10.1007/S10878-014-9796-ZzbMath1342.90215OpenAlexW2038313068MaRDI QIDQ5963657

Gregory Mulley, Yi Wang, Jian Cheng, Rong Luo

Publication date: 23 February 2016

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

Full work available at URL: https://doi.org/10.1007/s10878-014-9796-z

zbMATH Keywords

maximum degree\(2\)-degenerateadjacent vertex-distinguishing edge coloring

Mathematics Subject Classification ID

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

Related Items (5)

Neighbor sum distinguishing total coloring of 2-degenerate graphs ⋮ Neighbor sum distinguishing index of 2-degenerate graphs ⋮ Adjacent vertex distinguishing edge choosability of 1-planar graphs with maximum degree at least 23 ⋮ Upper bounds for adjacent vertex-distinguishing edge coloring ⋮ Progress on the Adjacent Vertex Distinguishing Edge Coloring Conjecture

Cites Work

• Adjacent vertex-distinguishing edge coloring of graphs with maximum degree \(\Delta\)
• 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
• On Neighbor-Distinguishing Index of Planar Graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Adjacent vertex-distinguishing edge coloring of 2-degenerate graphs