Two-distance vertex-distinguishing index of sparse graphs

DOI10.1515/MATH-2023-0140zbMATH Open1547.05095MaRDI QIDQ6611486

Author name not available (Why is that?), Li Liang, Wei Gao

Publication date: 26 September 2024

Published in: Open Mathematics (Search for Journal in Brave)

zbMATH Keywords

edge coloringmaximum average degreetwo-distance vertex-distinguishing index

Mathematics Subject Classification ID

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

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
• Two-distance vertex-distinguishing index of sparse subcubic 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
• Concentration of rainbow \(k\)-connectivity of a multiplex random graph
• Legally $$(\varDelta +2)$$ ( Δ + 2 ) -Coloring Bipartite Outerplanar Graphs in Cubic Time
• Adjacent Vertex Distinguishing Edge‐Colorings

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)