Xiaoli Yuan, Yuejian Peng. Tight bound on the minimum degree to guarantee graphs forbidding some odd cycles to be bipartite. // European Journal of Combinatorics. – 2025. – DOI: 10.1016/j.ejc.2025.104143. – URL: https://doi.org/10.1016/j.ejc.2025.104143
Xiaoli Yuan & Yuejian Peng (2025). Tight bound on the minimum degree to guarantee graphs forbidding some odd cycles to be bipartite. European Journal of Combinatorics. https://doi.org/10.1016/j.ejc.2025.104143
Xiaoli Yuan and Yuejian Peng. “Tight bound on the minimum degree to guarantee graphs forbidding some odd cycles to be bipartite.” European Journal of Combinatorics, 2025. doi:10.1016/j.ejc.2025.104143.
@article{Yuan2025,
title = {Tight bound on the minimum degree to guarantee graphs forbidding some odd cycles to be bipartite},
author = {Yuan, Xiaoli and Peng, Yuejian},
journal = {European Journal of Combinatorics},
year = {2025},
doi = {10.1016/j.ejc.2025.104143},
url = {https://doi.org/10.1016/j.ejc.2025.104143}
}