scientific article; zbMATH DE number 7594599
From MaRDI portal
Publication:5037994
Publication date: 29 September 2022
Full work available at URL: https://www.actamath.com/Jwk_sxxb_cn/EN/Y2022/V65/I2/325
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)
Cites Work
- Unnamed Item
- Unnamed Item
- 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
- Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree
- Adjacent strong edge coloring of graphs
- \(\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
This page was built for publication:
