Three-coloring triangle-free graphs on surfaces VI. 3-colorability of quadrangulations

IF 1.2 1区数学 Q1 MATHEMATICS

Journal of Combinatorial Theory Series B Pub Date : 2023-11-18 DOI:10.1016/j.jctb.2023.11.001

Zdeněk Dvořák , Daniel Král' , Robin Thomas

引用次数: 12

Abstract

We give a linear-time algorithm to decide 3-colorability (and find a 3-coloring, if it exists) of quadrangulations of a fixed surface. The algorithm also allows to prescribe the coloring for a bounded number of vertices.

查看原文本刊更多论文

曲面上的无三角形图的三色性VI.四边形的三色性

我们给出了一种线性时间算法来确定一个固定曲面的四边形的可3色性(并找到一个3色，如果它存在的话)。该算法还允许为有限数量的顶点指定颜色。

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

求助全文

约1分钟内获得全文求助全文

来源期刊

Journal of Combinatorial Theory Series B 数学-数学

CiteScore

2.70

自引率

14.30%

发文量

审稿时长

6-12 weeks

期刊介绍： The Journal of Combinatorial Theory publishes original mathematical research dealing with theoretical and physical aspects of the study of finite and discrete structures in all branches of science. Series B is concerned primarily with graph theory and matroid theory and is a valuable tool for mathematicians and computer scientists.