Searcharxiv⌕ Search

arXiv subjects

Kolja Kühn

Publications and source records attributed to Kolja Kühn.

4 recordsLinked to original sources

Feedback Vertex Set, Max Cut, and Edge Coloring on the Strong Product of a Graph and a Path

We examine the computational complexity of well-known problems on subgraphs of the strong product of two paths. Namely, for Max Cut we show NP-hardness on induced subgraphs of $P \boxtimes P$ answering a question by Dvořák, Huynh, Joret, Liu, and Wood (2021). For 3-Edge Coloring we show NP-hardness on subgraphs of $P \boxtimes P$ and that it is equivalent to 3-Edge Coloring on planar graphs for induced subgraphs of $P \boxtimes P$. It is a long standing open question whether 3-Edge Coloring on planar graphs is NP-hard. As a second contribution, we consider graphs of the form $G \boxtimes P$ and show that Feedback Vertex Set on these graphs is FPT in the clique-width of $G$. Furthermore, we show that it can be solved in polynomial time if $G$ is chordal or co-comparable and that the computational complexity depends on the parity of $P$ if $G$ is bipartite. Namely, it is solvable in polynomial time if $P$ has an even number of vertices but is NP-complete otherwise. For Max Cut, we show that it can be solved in polynomial time if $G$ is bipartite.

cs.CC↗

Treedepth is NP-Hard on Planar Graphs of Maximum Degree 3

Treedepth is an important parameter in algorithmic graph theory. It is known that the problem of computing the treedepth of a graph is NP-hard. It has been an open problem whether treedepth can be computed in polynomial time when the input graph is restricted to be planar, or of bounded degree. Assuming $P \neq NP$, we answer both questions in the negative: Under polynomial-time Turing reductions, it is NP-hard to compute the treedepth of planar graphs with maximum degree 3. This degree bound is best possible, since treedepth can be computed efficiently on graphs of maximum degree 2.

cs.DM↗

Completing the Complexity Classification of 2-Solo Chess: Knights and Kings are Hard

We extend the study of the 2-Solo Chess problem which was first introduced by Aravind, Misra, and Mittal in 2022. 2-Solo Chess is a single-player variant of chess in which the player must clear the board via captures such that only one piece remains, with each piece capturing at most twice. It is known that the problem is solvable in polynomial time for instances containing only pawns, while it becomes NP-complete for instances restricted to rooks, bishops, or queens. In this work, we complete the complexity classification by proving that 2-Solo Chess is NP-complete if the instance contains only knights or only kings.

cs.CC↗

Computing Treedepth Obstructions

The graph parameter treedepth is minor-monotone; hence, the class of graphs with treedepth at most $k$ is minor-closed. By the Graph Minor Theorem, such a class is characterized by a finite set of forbidden minors. A conjecture of Dvořák, Giannopoulou, and Thilikos states that every such forbidden minor has at most $2^k$ vertices. We present an algorithm that, given $n, k \in \mathbb{N}$, computes the set of forbidden minors, forbidden subgraphs, and forbidden induced subgraphs on at most $n$ vertices, for the class of graphs of treedepth at most $k$. Applying this algorithm to $k = 4$ and $n = 16$, we enumerate 1546 forbidden minors, 1718 forbidden subgraphs, and 12204 forbidden induced subgraphs. Assuming the above conjecture holds, these sets constitute the complete obstruction sets for graphs of treedepth at most 4.

cs.DM↗