Ervin Györi, Alexandr V. Kostochka, Tomasz Luczak. Graphs without short odd cycles are nearly bipartite. Discrete Mathematics, 163(1-3):279-284, 1997. [doi]
@article{GyoriKL97, title = {Graphs without short odd cycles are nearly bipartite}, author = {Ervin Györi and Alexandr V. Kostochka and Tomasz Luczak}, year = {1997}, doi = {10.1016/0012-365X(95)00321-M}, url = {http://dx.doi.org/10.1016/0012-365X(95)00321-M}, tags = {graph-rewriting, rewriting}, researchr = {https://researchr.org/publication/GyoriKL97}, cites = {0}, citedby = {0}, journal = {Discrete Mathematics}, volume = {163}, number = {1-3}, pages = {279-284}, }