On the neighbor-distinguishing indices of planar graphs
DOI10.1007/S40840-021-01213-9zbMATH Open1485.05069OpenAlexW3216262375MaRDI QIDQ2117565FDOQ2117565
Jingjing Huo, Yiqiao Wang, Weifan Wang, Wenjing Xia
Publication date: 21 March 2022
Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40840-021-01213-9
Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Vertex degrees (05C07) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Title not available (Why is that?)
- Adjacent strong edge coloring of graphs
- Some bounds on the neighbor-distinguishing index of graphs
- \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
- Adjacent Vertex Distinguishing Edge‐Colorings
- On Neighbor-Distinguishing Index of Planar Graphs
- \(r\)-strong edge colorings of graphs
- An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph
- Edge-partitions of graphs and their neighbor-distinguishing index
- A Characterization on the Adjacent Vertex Distinguishing Index of Planar Graphs with Large Maximum Degree
- Progress on the Adjacent Vertex Distinguishing Edge Coloring Conjecture
Cited In (6)
- On Neighbor-Distinguishing Index of Planar Graphs
- Local neighbor-distinguishing index of graphs
- Title not available (Why is that?)
- Some bounds on the neighbor-distinguishing index of graphs
- Strict neighbor-distinguishing index of subcubic graphs
- Neighbor-distinguishing indices of planar graphs with maximum degree ten
This page was built for publication: On the neighbor-distinguishing indices of planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117565)
