On the list injective coloring of planar graphs without a $ {4^ - } $-cycle intersecting with a $ {5^ - } $-cycle

On the list injective coloring of planar graphs without a $ {4^ - } $-cycle intersecting with a $ {5^ - } $-cycle

An injective coloring of a graph $ G $ is a vertex coloring such that a pair of vertices obtain distinct colors if there is a path of length two between them. It is proved in this paper that $ \chi _i^l(G) \le \Delta + 4 $ if $ \Delta \ge 12 $ when $ G $ does not have a $ {4^ - } $-cycle intersectin...

ver descrição completa

Detalhes bibliográficos
Principais autores: Yuehua Bu, Hongrui Zheng, Hongguo Zhu
Formato: Artigo
Idioma:English
Publicado em: AIMS Press 2025-01-01
coleção:AIMS Mathematics
Assuntos:
injective coloring
face
discharging method
planar graph
cycle
Acesso em linha:https://www.aimspress.com/article/doi/10.3934/math.2025083

Internet

https://www.aimspress.com/article/doi/10.3934/math.2025083

Registros relacionados