Adjacent vertex distinguishing edge coloring of planar graphs without 3-cycles
From MaRDI portal
Publication:5858150
DOI10.1142/S1793830920500354zbMath1458.05070MaRDI QIDQ5858150
Stephen Finbow, Danjun Huang, Xiaoxiu Zhang, Wei Fan Wang
Publication date: 9 April 2021
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Related Items (1)
Cites Work
- Adjacent vertex-distinguishing edge coloring of graphs with maximum degree \(\Delta\)
- Adjacent vertex distinguishing indices of planar graphs without 3-cycles
- Adjacent vertex distinguishing edge colorings of planar graphs with girth at least five
- Adjacent vertex-distinguishing edge colorings of \(K_{4}\)-minor free graphs
- \(r\)-strong edge colorings of graphs
- Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree
- Adjacent strong edge coloring of graphs
- Edge-partitions of graphs and their neighbor-distinguishing index
- \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
- Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least six
- 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
This page was built for publication: Adjacent vertex distinguishing edge coloring of planar graphs without 3-cycles
