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

DOI10.1137/120903178MaRDI QIDQ3461985zbMATH OpenOpenAlexFDO

Authors 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

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)

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

Cites work

• scientific article; zbMATH DE number 3428958 (Why is no real title available?)
• Adjacent Vertex Distinguishing Edge‐Colorings
• Adjacent strong edge coloring of graphs
• Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree
• Adjacent vertex-distinguishing edge coloring of graphs with maximum degree \(\Delta\)
• Adjacent vertex-distinguishing edge coloring of graphs with maximum degree at least five
• Adjacent vertex-distinguishing edge colorings of \(K_{4}\)-minor free graphs
• On Neighbor-Distinguishing Index of Planar Graphs
• On the neighbour-distinguishing index of a graph
• \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number

Cited in

(20)

• Adjacent vertex distinguishing edge choosability of 1-planar graphs with maximum degree at least 23
• scientific article; zbMATH DE number 7594599 (Why is no real title available?)
• Adjacent vertex distinguishing index of bipartite planar graphs
• The adjacent vertex distinguishing edge choosability of planar graphs with maximum degree at least 11
• On the neighbor-distinguishing indices of planar graphs
• Adjacent vertex distinguishing edge coloring of planar graphs without 3-cycles
• Neighbor-distinguishing indices of planar graphs with maximum degree ten
• Adjacent vertex distinguishing edge coloring of planar graphs without 4-cycles
• Strict neighbor-distinguishing index of subcubic graphs
• Adjacent vertex distinguishing edge coloring of IC-planar graphs
• scientific article; zbMATH DE number 6843221 (Why is no real title available?)
• Neighbor sum distinguishing index of subcubic graphs
• On Neighbor-Distinguishing Index of Planar Graphs
• Adjacent vertex distinguishing index of graphs with maximum degree six
• Adjacent vertex distinguishing total coloring of planar graphs with large maximum degree
• Adjacent vertex distinguishing indices of planar graphs without 3-cycles
• Some bounds on the neighbor-distinguishing index of graphs
• Local neighbor-distinguishing index of graphs
• Adjacent-vertex-distinguishing proper edge colorings of planar bipartite graphs with \(\Delta=9\), \(10\), or \(11\)
• Strict neighbor-distinguishing index of \(K_4\)-minor-free graphs

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)