1 平面图形中的等价着色

IF 0.7 3区数学 Q2 MATHEMATICS

Discrete Mathematics Pub Date : 2024-10-18 DOI:10.1016/j.disc.2024.114286

引用次数: 0

摘要

对于每一个 r≥13，我们都能证明Δ(G)≤r 的每一个 1 平面图形 G 都有一个公平的 r 着色。

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

查看原文本刊更多论文

Equitable coloring in 1-planar graphs

For every

r \geq 13

, we show every 1-planar graph G with

Δ (G) \leq r

has an equitable r-coloring.

求助全文

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

来源期刊

Discrete Mathematics 数学-数学

CiteScore

1.50

自引率

12.50%

发文量

424

审稿时长

6 months

期刊介绍： Discrete Mathematics provides a common forum for significant research in many areas of discrete mathematics and combinatorics. Among the fields covered by Discrete Mathematics are graph and hypergraph theory, enumeration, coding theory, block designs, the combinatorics of partially ordered sets, extremal set theory, matroid theory, algebraic combinatorics, discrete geometry, matrices, and discrete probability theory. Items in the journal include research articles (Contributions or Notes, depending on length) and survey/expository articles (Perspectives). Efforts are made to process the submission of Notes (short articles) quickly. The Perspectives section features expository articles accessible to a broad audience that cast new light or present unifying points of view on well-known or insufficiently-known topics.