Adjacent vertex-distinguishing edge coloring of 2-degenerate graphs

DOI10.1007/S10878-014-9796-ZzbMATH Open1342.90215OpenAlexW2038313068MaRDI QIDQ5963657FDOQ5963657

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

Recommendations

• Adjacent vertex distinguishing total colorings of 2-degenerate graphs
• Adjacent vertex-distinguishing edge coloring of graphs
• On the adjacent vertex distinguishing edge colourings of graphs
• Adjacent vertex-distinguishing acyclic edge coloring of graphs
• Adjacent Vertex Distinguishing Edge‐Colorings
• On the adjacent vertex-distinguishing acyclic edge coloring of some graphs
• Vertex-edge adjacent vertex-distinguishing total colorings of some graphs
• Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree
• Adjacent vertex-distinguishing edge coloring of graphs with maximum degree \(\Delta\)
• Vertex-distinguishing edge-colorings of 2-regular graphs

zbMATH Keywords

maximum degreeadjacent vertex-distinguishing edge coloring\(2\)-degenerate

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (7)

• Neighbor sum distinguishing index of 2-degenerate graphs
• Title not available (Why is that?)
• Adjacent vertex distinguishing edge choosability of 1-planar graphs with maximum degree at least 23
• Neighbor sum distinguishing total coloring of 2-degenerate graphs
• Progress on the Adjacent Vertex Distinguishing Edge Coloring Conjecture
• Acyclic edge coloring of 2-degenerate graphs
• Upper bounds for adjacent vertex-distinguishing edge coloring

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5963657)