A smaller upper bound for the list injective chromatic number of planar graphs
An injective vertex coloring of a graph $ G $ is a coloring where no two vertices that share a common neighbor are assigned the same color. If for any list $ L $ of permissible colors with size $ k $ assigned to the vertices $ V(G) $ of a graph $ G $, there exists an injective coloring $ \varphi $ i...
| 主要な著者: | , |
|---|---|
| フォーマット: | 論文 |
| 言語: | English |
| 出版事項: |
AIMS Press
2025-01-01
|
| シリーズ: | AIMS Mathematics |
| 主題: | |
| オンライン･アクセス: | https://www.aimspress.com/article/doi/10.3934/math.2025014 |