Strict neighbor-distinguishing index of subcubic graphs

DOI10.1007/s00373-020-02246-wzbMath1459.05078OpenAlexW3098608895MaRDI QIDQ2657091

Jing Gu, Ying Wang, Wei Fan Wang, Yi Qiao 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

subcubic graphstrict neighbor-distinguishing edge coloringstrict neighbor-distinguishing index

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (3)

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

Cites Work

• An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph
• \(r\)-strong edge colorings of graphs
• 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
• A Characterization on the Adjacent Vertex Distinguishing Index of Planar Graphs with Large Maximum Degree
• Adjacent Vertex Distinguishing Edge‐Colorings
• On Neighbor-Distinguishing Index of Planar Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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