Crossref
Planar graphs with Ore-degree at most seven is strongly 13-edge-colorable
Discrete Applied Mathematics · 2026-06 · 386 · 345-364
DOI: 10.1016/j.dam.2026.02.040 ↗Kurz gefasst
Fachartikel in der Zeitschrift Discrete Applied Mathematics, 2026-06. Verfasst von Seth Nelson und 1 weiteren Autor:innen. Die Arbeit nennt 15 Literaturangaben.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Zitieren
APA
Nelson, S., & Yu, G. (2026). Planar graphs with Ore-degree at most seven is strongly 13-edge-colorable. Discrete Applied Mathematics, 386, 345-364. https://doi.org/10.1016/j.dam.2026.02.040
Vancouver
Nelson S, Yu G. Planar graphs with Ore-degree at most seven is strongly 13-edge-colorable. Discrete Applied Mathematics. 2026;386:345-364. doi:10.1016/j.dam.2026.02.040
BibTeX
@article{Nelson2026,
author = {Nelson, Seth and Yu, Gexin},
title = {Planar graphs with Ore-degree at most seven is strongly 13-edge-colorable},
journal = {Discrete Applied Mathematics},
year = {2026},
volume = {386},
pages = {345--364},
doi = {10.1016/j.dam.2026.02.040}
}
EUVIMED