Two-distance vertex-distinguishing index of sparse subcubic graphs

DOI10.1007/s40840-019-00862-1zbMath1441.05085OpenAlexW2989903217WikidataQ126624841 ScholiaQ126624841MaRDI QIDQ2186287

Loumngam Kamga Victor, Juan Liu, Wei Fan 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

edge coloringsubcubic graph2-distance vertex-distinguishing indexmaximum average degreeAVD edge coloring

Mathematics Subject Classification ID

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

Related Items

2-DISTANCE VERTEX DISTINGUISHING INDEX OF SPARSE GRAPHS, On (almost) \(2\)-\(Y\)-homogeneous distance-biregular graphs

Cites Work

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