Two-distance vertex-distinguishing index of sparse graphs

DOI10.1515/MATH-2023-0140MaRDI QIDQ6611486zbMATH OpenFDO

Authors Li Liang, Wei Gao

Publication date 26 September 2024

Published in Open Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1515/MATH-2023-0140

zbMATH Keywords

edge coloringmaximum average degreetwo-distance vertex-distinguishing index

Mathematics Subject Classification ID

Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15)

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
• Concentration of rainbow \(k\)-connectivity of a multiplex random 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
• Two-distance vertex-distinguishing index of sparse subcubic graphs

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

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