Strict neighbor-distinguishing index of \(K_4\)-minor-free graphs
From MaRDI portal
Publication:2686134
DOI10.1016/j.dam.2023.01.017OpenAlexW4317810493MaRDI QIDQ2686134
Jing Gu, Lina Zheng, Wei Fan Wang, Yi Qiao Wang
Publication date: 24 February 2023
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2023.01.017
\(K_4\)-minor-free graphstrict neighbor-distinguishing indexformal graphlocal neighbor-distinguishing index
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Graph minors (05C83) Ramsey theory (05D10)
Related Items
Cites Work
- \(r\)-strong edge colorings of graphs
- Adjacent strong edge coloring of graphs
- Some bounds on the neighbor-distinguishing index of graphs
- Topology of series-parallel networks
- Edge-partitions of graphs and their neighbor-distinguishing index
- \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
- Strict neighbor-distinguishing index of subcubic graphs
- A Characterization on the Adjacent Vertex Distinguishing Index of Planar Graphs with Large Maximum Degree
- Progress on the Adjacent Vertex Distinguishing Edge Coloring Conjecture
- On Neighbor-Distinguishing Index of Planar Graphs
- On the inclusion chromatic index of a graph
- Unnamed Item