JOURNAL ARTICLE

Adjacent vertex distinguishing edge choosability of 1-planar graphs with maximum degree at least 23

Lin SunGuanglong YuXin Li

Year: 2023 Journal:   Discrete Applied Mathematics Vol: 337 Pages: 257-271   Publisher: Elsevier BV
Keywords:
Combinatorics Mathematics Vertex (graph theory) Planar graph Graph Edge coloring Simple graph Bound graph Discrete mathematics Graph power Line graph

Metrics

2
Cited By
0.62
FWCI (Field Weighted Citation Impact)
23
Refs
0.64
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

Graph Labeling and Dimension Problems
Physical Sciences →  Computer Science →  Computational Theory and Mathematics

Related Documents

JOURNAL ARTICLE

The adjacent vertex distinguishing edge choosability of planar graphs with maximum degree at least 11

Xiaohan ChengWang BinJihui Wang

Journal:   Discrete Applied Mathematics Year: 2022 Vol: 313 Pages: 29-39
JOURNAL ARTICLE

Adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least 10

Yu‐Lin ChangQiancheng OuyangGuanghui Wang

Journal:   Journal of Combinatorial Optimization Year: 2019 Vol: 38 (1)Pages: 185-196
JOURNAL ARTICLE

The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven

Xiaohan ChengJianliang Wu

Journal:   Journal of Combinatorial Optimization Year: 2017 Vol: 35 (1)Pages: 1-13
JOURNAL ARTICLE

Adjacent vertex-distinguishing edge coloring of graphs with maximum degree at least five

Hervé HocquardMickaël Montassier

Journal:   Electronic Notes in Discrete Mathematics Year: 2011 Vol: 38 Pages: 457-462
JOURNAL ARTICLE

Adjacent vertex-distinguishing edge coloring of graphs with maximum degree Δ

Hervé HocquardMickaël Montassier

Journal:   Journal of Combinatorial Optimization Year: 2012 Vol: 26 (1)Pages: 152-160
© 2026 ScienceGate Book Chapters — All rights reserved.