Coloring Tournaments with Few Colors: Algorithms and Complexity

Authors

Institutions

Publication Details

Journal
SIAM Journal on Discrete Mathematics
Published
2024-12-12
DOI
https://doi.org/10.1137/23m1602127
Primary Topic
Advanced Graph Theory Research
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Coloring Tournaments with Few Colors: Algorithms and Complexity

Felix Klingelhoefer, Alantha Newman
SIAM Journal on Discrete Mathematics
Advanced Graph Theory Research
article

Coloring Tournaments with Few Colors: Algorithms and Complexity

Felix Klingelhoefer, Alantha Newman
article en

Abstract

No abstract available for this paper.
SIAM Journal on Discrete MathematicsVol. 38(4)
Centre National de la Recherche Scientifique (FR), Laboratoire des Sciences pour la Conception, l'Optimisation et la Production (FR), Université Grenoble Alpes (FR)
Agence Nationale de la Recherche
Openalex Percentile: Top 73%
Advanced Graph Theory Research
DOISourceOpenAlex
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Coloring Tournaments with Few Colors: Algorithms and Complexity — Felix Klingelhoefer, Alantha Newman · SIAM Journal on Discrete Mathematics (2024) | TGRS Research Map | TGRS