Two-distance vertex-distinguishing index of sparse subcubic graphs

DOI10.1007/S40840-019-00862-1MaRDI QIDQ2186287zbMATH OpenOpenAlexWikidataFDO

Authors Loumngam Kamga Victor, Juan Liu, Weifan Wang

Publication date 9 June 2020

Published in Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s40840-019-00862-1

zbMATH Keywords

2-distance vertex-distinguishing indexAVD edge coloringedge coloringmaximum average degreesubcubic graph

Mathematics Subject Classification ID

Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15) Density (toughness, etc.) (05C42)

Recommendations

• 2-distance vertex-distinguishing index of subcubic graphs
• An upper bound for D(2)-vertex-distinguishing proper edge chromatic numbers of graphs
• 2-distance vertex-distinguishing total coloring of graphs
• 2-distance coloring of sparse graphs
• Distance vertex-distinguishing index of outerplanar graphs

Cites work

• 2-distance vertex-distinguishing index of subcubic graphs
• \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
• r-strong edge colorings of graphs
• A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs
• Adjacent strong edge coloring of graphs
• Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree
• Adjacent Vertex Distinguishing Edge‐Colorings
• An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph
• Edge-partitions of graphs and their neighbor-distinguishing index
• Legally \((\varDelta +2)\)-coloring bipartite outerplanar graphs in cubic time
• Some bounds on the neighbor-distinguishing index of graphs

Cited in

(7)

• On (almost) 2-Y-homogeneous distance-biregular graphs
• Strict neighbor-distinguishing index of subcubic graphs
• Distance vertex-distinguishing index of outerplanar graphs
• 2-distance vertex-distinguishing total coloring of graphs
• 2-DISTANCE VERTEX DISTINGUISHING INDEX OF SPARSE GRAPHS
• Two-distance vertex-distinguishing index of sparse graphs
• 2-distance vertex-distinguishing index of subcubic graphs

This page was built for publication: Two-distance vertex-distinguishing index of sparse subcubic graphs

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