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...

Full description

Bibliographic Details

Published in:	Discrete Applied Mathematics Vol. 377; pp. 66 - 73
Main Authors:	Haviv, Ishay, Rabinovich, Dror
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 31.12.2025
Subjects:	Graph coloring Kernelization Linear algebra Parameterized complexity Graph coloring Parameterized complexity Linear algebra Kernelization
ISSN:	0166-218X
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!