Graphs without short odd cycles are nearly bipartite

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]

Authors

Ervin Györi

This author has not been identified. Look up 'Ervin Györi' in Google

Alexandr V. Kostochka

This author has not been identified. Look up 'Alexandr V. Kostochka' in Google

Tomasz Luczak

This author has not been identified. Look up 'Tomasz Luczak' in Google