Neighbor-distinguishing indices of planar graphs with maximum degree ten
From MaRDI portal
Publication:2686132
DOI10.1016/j.dam.2022.12.023OpenAlexW4313399904MaRDI QIDQ2686132
Danjun Huang, Jingjing Huo, Hongfeng Cai, Wei Fan 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.2022.12.023
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
- 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
- An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph
- The adjacent vertex distinguishing edge choosability of planar graphs with maximum degree at least 11
- On the neighbour-distinguishing index of a graph
- \(r\)-strong edge colorings of graphs
- Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree
- Adjacent strong edge coloring of graphs
- On the neighbor-distinguishing indices of planar graphs
- Adjacent vertex distinguishing edge coloring of planar graphs without 4-cycles
- 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
- 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
- Progress on the Adjacent Vertex Distinguishing Edge Coloring Conjecture
- Adjacent Vertex Distinguishing Edge‐Colorings
- On Neighbor-Distinguishing Index of Planar Graphs
- Adjacent vertex distinguishing edge coloring of planar graphs without 3-cycles
This page was built for publication: Neighbor-distinguishing indices of planar graphs with maximum degree ten