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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.