没有长度为 4、7 或 9 的周期的平面图是 DP-3 可着色的

IF 0.9 3区数学 Q2 MATHEMATICS

Journal of Graph Theory Pub Date : 2024-05-22 DOI:10.1002/jgt.23123

Yingli Kang, Ligang Jin, Xuding Zhu

引用次数: 0

摘要

本文证明了每个没有长度为 4、7 或 9 的循环的平面图都是 DP-3 可着色的。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Planar graphs having no cycle of length 4, 7, or 9 are DP-3-colorable

This paper proves that every planar graph having no cycle of length 4, 7, or 9 is DP-3-colorable.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Journal of Graph Theory 数学-数学

CiteScore

1.60

自引率

22.20%

发文量

130

审稿时长

6-12 weeks

期刊介绍： The Journal of Graph Theory is devoted to a variety of topics in graph theory, such as structural results about graphs, graph algorithms with theoretical emphasis, and discrete optimization on graphs. The scope of the journal also includes related areas in combinatorics and the interaction of graph theory with other mathematical sciences. A subscription to the Journal of Graph Theory includes a subscription to the Journal of Combinatorial Designs .