Colouring Probe $H$-Free Graphs
Fuente:
arXiv
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866915695759982592 |
|---|---|
| author | Paulusma, Daniël Rauch, Johannes van Leeuwen, Erik Jan |
| author_facet | Paulusma, Daniël Rauch, Johannes van Leeuwen, Erik Jan |
| contents | The NP-complete problems Colouring and k-Colouring $(k\geq 3$) are well studied on $H$-free graphs, i.e., graphs that do not contain some fixed graph $H$ as an induced subgraph. We research to what extent the known polynomial-time algorithms for $H$-free graphs can be generalized if we only know some of the edges of the input graph. We do this by considering the classical probe graph model introduced in the early nineties. For a graph $H$, a partitioned probe $H$-free graph $(G,P,N)$ consists of a graph $G=(V,E)$, together with a set $P\subseteq V$ of probes and an independent set $N=V\setminus P$ of non-probes, such that $G+F$ is $H$-free for some edge set $F\subseteq \binom{N}{2}$. We first fully classify the complexity of Colouring on partitioned probe $H$-free graphs and show that this dichotomy is different from the known dichotomy of Colouring for $H$-free graphs. Our main result is a dichotomy of $3$-Colouring for partitioned probe $P_t$-free graphs: we prove that the problem is polynomial-time solvable if $t\leq 5$ but NP-complete if $t\geq 6$. In contrast, $3$-Colouring on $P_t$-free graphs is known to be polynomial-time solvable if $t\leq 7$ and quasi polynomial-time solvable for $t\geq 8$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2505_20784 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Colouring Probe $H$-Free Graphs Paulusma, Daniël Rauch, Johannes van Leeuwen, Erik Jan Data Structures and Algorithms Discrete Mathematics Combinatorics The NP-complete problems Colouring and k-Colouring $(k\geq 3$) are well studied on $H$-free graphs, i.e., graphs that do not contain some fixed graph $H$ as an induced subgraph. We research to what extent the known polynomial-time algorithms for $H$-free graphs can be generalized if we only know some of the edges of the input graph. We do this by considering the classical probe graph model introduced in the early nineties. For a graph $H$, a partitioned probe $H$-free graph $(G,P,N)$ consists of a graph $G=(V,E)$, together with a set $P\subseteq V$ of probes and an independent set $N=V\setminus P$ of non-probes, such that $G+F$ is $H$-free for some edge set $F\subseteq \binom{N}{2}$. We first fully classify the complexity of Colouring on partitioned probe $H$-free graphs and show that this dichotomy is different from the known dichotomy of Colouring for $H$-free graphs. Our main result is a dichotomy of $3$-Colouring for partitioned probe $P_t$-free graphs: we prove that the problem is polynomial-time solvable if $t\leq 5$ but NP-complete if $t\geq 6$. In contrast, $3$-Colouring on $P_t$-free graphs is known to be polynomial-time solvable if $t\leq 7$ and quasi polynomial-time solvable for $t\geq 8$. |
| title | Colouring Probe $H$-Free Graphs |
| topic | Data Structures and Algorithms Discrete Mathematics Combinatorics |
| url | https://arxiv.org/abs/2505.20784 |