Crossref
1-Planar graphs without 5-cycles or adjacent triangles have at most 3n − 6 edges
Discrete Mathematics · 2027-02 · 350 (2) · 115440
DOI: 10.1016/j.disc.2026.115440 ↗Kurz gefasst
Fachartikel in der Zeitschrift Discrete Mathematics, 2027-02. Verfasst von Mengyao Dai und 1 weiteren Autor:innen. Die Arbeit nennt 12 Literaturangaben.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Zitieren
APA
Dai, M., & Zhang, X. (2027). 1-Planar graphs without 5-cycles or adjacent triangles have at most 3n − 6 edges. Discrete Mathematics, 350(2), 115440. https://doi.org/10.1016/j.disc.2026.115440
Vancouver
Dai M, Zhang X. 1-Planar graphs without 5-cycles or adjacent triangles have at most 3n − 6 edges. Discrete Mathematics. 2027;350(2):115440. doi:10.1016/j.disc.2026.115440
BibTeX
@article{Dai2027,
author = {Dai, Mengyao and Zhang, Xin},
title = {1-Planar graphs without 5-cycles or adjacent triangles have at most 3n − 6 edges},
journal = {Discrete Mathematics},
year = {2027},
volume = {350},
number = {2},
pages = {115440},
doi = {10.1016/j.disc.2026.115440}
}
EUVIMED