Strict neighbor-distinguishing index of subcubic graphs

DOI10.1007/S00373-020-02246-WzbMATH Open1459.05078OpenAlexW3098608895MaRDI QIDQ2657091FDOQ2657091

Authors: Jing Gu, Ying Wang, Weifan Wang, Yiqiao Wang 

Publication date: 17 March 2021

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-020-02246-w

Recommendations

• Neighbor sum distinguishing index of subcubic graphs
• Strict neighbor-distinguishing total index of graphs
• Some bounds on the neighbor-distinguishing index of graphs
• On the neighbour-distinguishing index of a graph
• 2-distance vertex-distinguishing index of subcubic graphs
• Two-distance vertex-distinguishing index of sparse subcubic graphs
• On Neighbor-Distinguishing Index of Planar Graphs
• On the neighbor-distinguishing indices of planar graphs
• Strict neighbor-distinguishing index of \(K_4\)-minor-free graphs
• A note on the neighbour-distinguishing index of digraphs

zbMATH Keywords

subcubic graphstrict neighbor-distinguishing edge coloringstrict neighbor-distinguishing index

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Adjacent strong edge coloring of graphs
• Some bounds on the neighbor-distinguishing index of graphs
• \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
• Adjacent Vertex Distinguishing Edge‐Colorings
• On Neighbor-Distinguishing Index of Planar Graphs
• \(r\)-strong edge colorings of graphs
• An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph
• Edge-partitions of graphs and their neighbor-distinguishing index
• A characterization on the adjacent vertex distinguishing index of planar graphs with large maximum degree
• On the Smarandachely-adjacent-vertex edge coloring of some double graphs
• Adjacent vertex distinguishing index of graphs with maximum degree six
• Bounds of Smarandachely adjacent vertex edge coloring of graphs
• An upper bound of the Smarandachely-adjacent-vertex acyclic edge coloring of graphs

Cited In (7)

• Strict neighbor-distinguishing index of \(K_4\)-minor-free graphs
• Strict neighbor-distinguishing total index of graphs
• 2-distance vertex-distinguishing index of subcubic graphs
• Local neighbor-distinguishing index of graphs
• Proper edge-colorings with a rich neighbor requirement
• The inclusion-free edge-colorings of \((3, \varDelta)\)-bipartite graphs
• On the inclusion chromatic index of a Halin graph

This page was built for publication: Strict neighbor-distinguishing index of subcubic graphs

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