Mengyao Dai, Xin Zhang. 1-Planar graphs without 5-cycles or adjacent triangles have at most 3n − 6 edges. // Discrete Mathematics. – 2027. – DOI: 10.1016/j.disc.2026.115440. – URL: https://doi.org/10.1016/j.disc.2026.115440
Mengyao Dai & Xin Zhang (2027). 1-Planar graphs without 5-cycles or adjacent triangles have at most 3n − 6 edges. Discrete Mathematics. https://doi.org/10.1016/j.disc.2026.115440
Mengyao Dai and Xin Zhang. “1-Planar graphs without 5-cycles or adjacent triangles have at most 3n − 6 edges.” Discrete Mathematics, 2027. doi:10.1016/j.disc.2026.115440.
@article{Dai2027,
title = {1-Planar graphs without 5-cycles or adjacent triangles have at most 3n − 6 edges},
author = {Dai, Mengyao and Zhang, Xin},
journal = {Discrete Mathematics},
year = {2027},
doi = {10.1016/j.disc.2026.115440},
url = {https://doi.org/10.1016/j.disc.2026.115440}
}