Crossref
Tight chromatic bounds for (P2+P4, K4−e)-free graphs
Discrete Applied Mathematics · 2026-08 · 389 · 308-322
DOI: 10.1016/j.dam.2026.04.017 ↗Kurz gefasst
Fachartikel in der Zeitschrift Discrete Applied Mathematics, 2026-08. Verfasst von C.U. Angeliya und 2 weiteren Autor:innen. Die Arbeit nennt 25 Literaturangaben. Gefördert von: Department of Atomic Energy, Government of India, National Natural Science Foundation of China, Christ University.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Förderung
- Department of Atomic Energy, Government of India
- National Natural Science Foundation of China
- Christ University
- NITTE University
- National Board for Higher Mathematics
- Tianjin Municipal Natural Science Foundation
Zitieren
APA
Angeliya, C., Karthick, T., & Huang, S. (2026). Tight chromatic bounds for (P2+P4, K4−e)-free graphs. Discrete Applied Mathematics, 389, 308-322. https://doi.org/10.1016/j.dam.2026.04.017
Vancouver
Angeliya C, Karthick T, Huang S. Tight chromatic bounds for (P2+P4, K4−e)-free graphs. Discrete Applied Mathematics. 2026;389:308-322. doi:10.1016/j.dam.2026.04.017
BibTeX
@article{Angeliya2026,
author = {Angeliya, C.U. and Karthick, T. and Huang, Shenwei},
title = {Tight chromatic bounds for (P2+P4, K4−e)-free graphs},
journal = {Discrete Applied Mathematics},
year = {2026},
volume = {389},
pages = {308--322},
doi = {10.1016/j.dam.2026.04.017}
}
EUVIMED