Minimum Label $k$-Cut on Planar Graphs: Complexity and Color Structure

Yuanhao Wang; Wei Wang

Home/Archive/arXiv

arXiv · 2610.40575

Minimum Label $k$-Cut on Planar Graphs: Complexity and Color Structure

Yuanhao Wang·Wei Wang

View original source ↗Read source document ↗Export metadata ↓

Abstract

Minimum Label $k$-Cut asks for a minimum-size set of colors such that deleting all edges of these colors leaves at least $k$ connected components. We study how the structure of the underlying graph and its color classes affects the complexity of this problem. Regarding fixed-parameter tractability with respect to $k$ on simple planar graphs, we prove that the problem is W[1]-hard, even when the underlying graph is a cactus graph and each color appears at most twice. Furthermore, for cactus graphs in which every color class is connected, we establish a complexity boundary in terms of the maximum monochromatic degree: when this degree is at most two, an optimal solution can be found in $O(Nk^2)$ time, where $N$ is the input size, with no restriction on color frequency or the number of blocks spanned by a color; allowing the maximum monochromatic degree to increase to three already makes the decision version NP-complete. Finally, we prove that the problem remains W[1]-hard parameterized by $k$ on fan graphs, even when every color class is an induced path. These results show that bounding color frequency does not suffice to eliminate parameterized hardness. They also establish a monochromatic-degree boundary for connected colors on cactus graphs and identify complexity barriers to extending this tractable case to outerplanar graphs.

Explore related subjects

cs.DS

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Yuanhao Wang, Wei Wang. 2026-10-29. Minimum Label $k$-Cut on Planar Graphs: Complexity and Color Structure. https://arxiv.org/abs/2610.40575

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

A Polynomial time Algorithm for 3SAT

By creating some new concepts and methods: checking tree, long unit path, direct contradiction unit pair, indirect contradiction unit pair, additional contradiction unit pair, 2-unit layer and 3-unit layer, redundant units, and destroying parallel pairs , we successfully transform solving a 3SAT problem to solving 2SAT problems in polynomial time. Thus we proved that NP=P.

cs.DS↗

arXiv2026

Sampling Sphere Packings with Continuum Glauber Dynamics

Continuum Glauber dynamics is a spatial birth-death process whose stationary distribution is a Gibbs distribution. We establish a spectral gap for Continuum Glauber dynamics applied to Gibbs point processes with repulsive pair potentials, a well-known special case of which is the hard sphere model. For arbitrary-range repulsive pair potentials, we show that a continuous version of Spectral Independence suffices to establish a spectral gap. This extends the regime of activity for which Continuum Glauber dynamics is known to mix, yielding a simple efficient sampling algorithm for arbitrary-range pair potentials that matches the known efficient sampling regime for finite-range pair potentials currently based on specialized algorithms. As a consequence, we also improve the threshold up to which packings of fixed size/density can be efficiently sampled from a bounded domain, the first improvement since Kannan, Mahoney and Montenegro (2003). To prove these results, we develop continuous analogs of Spectral Independence and negative fields localization. We show that a stronger variant of zero-freeness implies Spectral Independence, which in turn allows us to run the localization scheme to boost the spectral gap of Continuum Glauber dynamics from smaller activity to larger activity. While this follows the high-level blueprint of Chen and Eldan (2022) for the discrete setting, we have to address several novel difficulties due to the continuous setting. Notably, we avoid discretization in the algorithm and the analysis and work directly in the continuous setting.

cs.DS↗

arXiv2026

Model checking with temporal graphs and their derivative

Temporal graphs are graphs where the presence or properties of their vertices and edges change over time. When time is discrete, a temporal graph can be defined as a sequence of static graphs over a discrete time span, called lifetime, or as a single graph where each edge is associated with a specific set of time instants where the edge is alive. For static graphs, Courcelle's Theorem asserts that any graph problem expressible in monadic second-order logic can be solved in linear time on graphs of bounded tree-width. We propose the first adaptation of Courcelle's Theorem for monadic second-order logic on temporal graphs that does not explicitly rely on a parameter proportional to the lifetime, or defined as the maximum number of time-edges incident with any vertex which in the worst case is higher than the lifetime. We then introduce the notion of derivative over a sliding time window of a chosen size, and define the tree-width and twin-width of the temporal graph's derivative. We exemplify its usefulness with meta-theorems with respect to a temporal variant of first-order logic. The resulting logic expresses a wide range of temporal graph problems including a version of temporal cliques, an important notion when querying time series databases for community structures.

cs.DS↗