A characterization on the adjacent vertex distinguishing index of planar graphs with large maximum degree

DOI10.1137/120903178zbMATH Open1328.05070OpenAlexW2257828626MaRDI QIDQ3461985FDOQ3461985

Danjun Huang, Weifan Wang

Publication date: 4 January 2016

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

Full work available at URL: https://doi.org/10.1137/120903178

Recommendations

• Adjacent vertex distinguishing indices of planar graphs without 3-cycles
• The adjacent vertex distinguishing total coloring of planar graphs
• Adjacent vertex distinguishing total coloring of planar graphs with large maximum degree
• Adjacent vertex distinguishing index of bipartite planar graphs
• Adjacent vertex distinguishing edge coloring of planar graphs without 3-cycles

zbMATH Keywords

maximum degreeplanar graphadjacent vertex distinguishing coloring

Mathematics Subject Classification ID

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

Cites Work

• Adjacent strong edge coloring of graphs
• \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
• Title not available (Why is that?)
• Adjacent Vertex Distinguishing Edge‐Colorings
• On Neighbor-Distinguishing Index of Planar Graphs
• Adjacent vertex-distinguishing edge coloring of graphs with maximum degree at least five
• 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 \(K_{4}\)-minor free graphs

Cited In (14)

• Title not available (Why is that?)
• Strict neighbor-distinguishing index of \(K_4\)-minor-free graphs
• On the neighbor-distinguishing indices of planar graphs
• Neighbor sum distinguishing index of subcubic graphs
• Adjacent vertex distinguishing edge coloring of planar graphs without 4-cycles
• Adjacent vertex distinguishing edge choosability of 1-planar graphs with maximum degree at least 23
• On Neighbor-Distinguishing Index of Planar Graphs
• Adjacent vertex distinguishing edge coloring of IC-planar graphs
• Local neighbor-distinguishing index of graphs
• Title not available (Why is that?)
• Some bounds on the neighbor-distinguishing index of graphs
• Strict neighbor-distinguishing index of subcubic graphs
• Neighbor-distinguishing indices of planar graphs with maximum degree ten
• Adjacent vertex distinguishing edge coloring of planar graphs without 3-cycles

This page was built for publication: A characterization on the adjacent vertex distinguishing index of planar graphs with large maximum degree

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