Crossref
Every planar graph without 4- and 6-cycles is (2,5)-colorable
Discrete Mathematics · 2026-10 · 349 (10) · 115206
DOI: 10.1016/j.disc.2026.115206 ↗Kurz gefasst
Fachartikel in der Zeitschrift Discrete Mathematics, 2026-10. Verfasst von Kaiyang Hu und 1 weiteren Autor:innen. Die Arbeit nennt 20 Literaturangaben. Gefördert von: National Natural Science Foundation of China.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Förderung
- National Natural Science Foundation of China
Zitieren
APA
Hu, K., & Huang, M. (2026). Every planar graph without 4- and 6-cycles is (2,5)-colorable. Discrete Mathematics, 349(10), 115206. https://doi.org/10.1016/j.disc.2026.115206
Vancouver
Hu K, Huang M. Every planar graph without 4- and 6-cycles is (2,5)-colorable. Discrete Mathematics. 2026;349(10):115206. doi:10.1016/j.disc.2026.115206
BibTeX
@article{Hu2026,
author = {Hu, Kaiyang and Huang, Mingfang},
title = {Every planar graph without 4- and 6-cycles is (2,5)-colorable},
journal = {Discrete Mathematics},
year = {2026},
volume = {349},
number = {10},
pages = {115206},
doi = {10.1016/j.disc.2026.115206}
}
EUVIMED