Open Access · CC BY 4.0
Optimal list recoloring of subcubic graphs and complete multipartite graphs
Discrete Mathematics · 2026-08 · 349 (8) · 115155
DOI: 10.1016/j.disc.2026.115155 ↗Kurz gefasst
Fachartikel in der Zeitschrift Discrete Mathematics, 2026-08. Verfasst von Lucas De Meyer. Die Arbeit nennt 14 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
Kein Abstract verfügbar.
Zitieren
APA
Meyer, L. D. (2026). Optimal list recoloring of subcubic graphs and complete multipartite graphs. Discrete Mathematics, 349(8), 115155. https://doi.org/10.1016/j.disc.2026.115155
Vancouver
Meyer LD. Optimal list recoloring of subcubic graphs and complete multipartite graphs. Discrete Mathematics. 2026;349(8):115155. doi:10.1016/j.disc.2026.115155
BibTeX
@article{Meyer2026,
author = {Meyer, Lucas De},
title = {Optimal list recoloring of subcubic graphs and complete multipartite graphs},
journal = {Discrete Mathematics},
year = {2026},
volume = {349},
number = {8},
pages = {115155},
doi = {10.1016/j.disc.2026.115155}
}
EUVIMED