Adjacent vertex distinguishing indices of planar graphs without 3-cycles

DOI10.1016/j.disc.2014.10.010zbMath1305.05053OpenAlexW2056792956MaRDI QIDQ482220

Danjun Huang, Wei Fan Wang, Zheng-Ke Miao

Publication date: 19 December 2014

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2014.10.010

zbMATH Keywords

cycleplanar graphmaximum degreeadjacent vertex distinguishing coloring

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)

Related Items (4)

Adjacent vertex distinguishing edge coloring of planar graphs without 4-cycles ⋮ Neighbor-distinguishing indices of planar graphs with maximum degree ten ⋮ Unnamed Item ⋮ Adjacent vertex distinguishing edge coloring of planar graphs without 3-cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Adjacent vertex-distinguishing edge coloring of graphs with maximum degree \(\Delta\)
• Adjacent vertex distinguishing edge colorings of planar graphs with girth at least five
• 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

This page was built for publication: Adjacent vertex distinguishing indices of planar graphs without 3-cycles