Parameterized Graph Coloring
Parameterized Graph Coloring is a computational framework within graph theory that refines the classical graph coloring problem by analyzing its complexity and solvability in terms of a specific parameter, such as treewidth or vertex cover size, to enable fixed-parameter tractable algorithms.
12
Publications
406
Citations
27
Authors
23
Institutions
Publications per year
2017–2026
4
Parents
12
Parameterized coloring problems on chordal graphs
Dániel Marx · Theoretical Computer Science · 2005 · 62 citations
1–5 of 12
27
3
h-index
2
h-index
1 publications · 15 citations
1
h-index
1
h-index
1
h-index
1–5 of 27
23
Sobolev Institute of Mathematics
Novosibirsk, Russia
2 h-index
5 publications
65 citations
HUN-REN Institute for Computer Science and Control
Budapest, Hungary
2 h-index
2 publications
34 citations
Technische Universität Berlin
Berlin, Germany
2 h-index
3 publications
122 citations
Friedrich Schiller University Jena
Jena, Germany
2 h-index
6 publications
302 citations

École Normale Supérieure de Lyon
Lyon, France
1 h-index
2 publications
26 citations

Universidade Federal do Rio de Janeiro
Rio de Janeiro, Brazil
1 h-index
3 publications
69 citations
University of Illinois Urbana-Champaign
Urbana, United States
1 h-index
1 publications
21 citations
Simon Fraser University
Burnaby, Canada
1 h-index
1 publications
21 citations
1–8 of 23
3 publications · 127 citations
3
h-index
1 publications · 23 citations
1
h-index
1 publications · 13 citations
1
h-index
1 publications · 102 citations
1
h-index
1 publications · 60 citations
1
h-index
1–5