A near-optimal kernel for a coloring problem

For a fixed integer q, the q− Coloring problem asks to decide if a given graph has a vertex coloring with q colors such that no two adjacent vertices receive the same color. In a series of papers, it has been shown that for every q≥3, the q− Coloring problem parameterized by the vertex cover number...

Celý popis

Podrobná bibliografia

Vydané v:	Discrete Applied Mathematics Ročník 377; s. 66 - 73
Hlavní autori:	Haviv, Ishay, Rabinovich, Dror
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 31.12.2025
Predmet:	Graph coloring Kernelization Linear algebra Parameterized complexity Graph coloring Parameterized complexity Linear algebra Kernelization
ISSN:	0166-218X
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!