List-k-Coloring H-Free Graphs for All k>4

Given an integer k > 4 and a graph H , we prove that, assuming P ≠ NP, the List- k -Coloring Problem restricted to H -free graphs can be solved in polynomial time if and only if either every component of H is a path on at most three vertices, or removing the isolated vertices of H leaves an induc...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Combinatorica (Budapest. 1981) Ročník 44; číslo 5; s. 1063 - 1068
Hlavní autori: Chudnovsky, Maria, Hajebi, Sepehr, Spirkl, Sophie
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Berlin/Heidelberg Springer Berlin Heidelberg 01.10.2024
Springer Nature B.V
Predmet:
Apexes
Coloring
Combinatorics
Graph theory
Graphs
Mathematics
Mathematics and Statistics
Original Paper
Polynomials
Coloring
Polynomial-time Algorithms
List-Coloring
Induced subgraphs
ISSN:0209-9683, 1439-6912
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:Given an integer k > 4 and a graph H , we prove that, assuming P ≠ NP, the List- k -Coloring Problem restricted to H -free graphs can be solved in polynomial time if and only if either every component of H is a path on at most three vertices, or removing the isolated vertices of H leaves an induced subgraph of the five-vertex path. In fact, the “if” implication holds for all k ≥ 1 .
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0209-9683
1439-6912
DOI:10.1007/s00493-024-00106-2