Abstract:A graph coloring has bounded clustering if each monochromatic component has bounded size. This paper studies such a coloring, where the number of colors depends on an excluded complete bipartite subgraph. This is a much weaker assumption than previous works, where typically the number of colors depends on an excluded minor. This paper focuses on graph classes with bounded layered treewidth, which include planar graphs, graphs of bounded Euler genus, graphs embeddable on a fixed surface with a bounded number of crossings per edge, amongst other examples. Our main theorem says that for fixed integers $s,t,k$, every graph with layered treewidth at most $k$ and with no $K_{s,t}$ subgraph is $(s+2)$-colorable with bounded clustering. The $s=3$ case implies that every graph with a drawing on a fixed surface with a bounded number of crossings per edge is 5-colorable with bounded clustering. Our main theorem is also a critical component in two companion papers that study clustered coloring of graphs with no $K_{s,t}$ subgraph and excluding a fixed minor, odd minor or topological minor.
From: Chun-Hung Liu [view email]
[v1]
Wed, 22 May 2019 06:14:19 UTC (70 KB)
[v2]
Wed, 19 Feb 2020 01:11:07 UTC (121 KB)
[v3]
Wed, 25 Nov 2020 07:57:27 UTC (79 KB)
[v4]
Wed, 28 Sep 2022 05:05:37 UTC (83 KB)
[v5]
Sun, 14 Jun 2026 17:13:49 UTC (83 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。