Strict neighbor-distinguishing index of subcubic graphs

DOI10.1007/S00373-020-02246-WMaRDI QIDQ2657091zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

strict neighbor-distinguishing edge coloringstrict neighbor-distinguishing indexsubcubic graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

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

Cites work

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

Cited in

(8)

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

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)