Graphs without short odd cycles are nearly bipartite

Research output: Contribution to journal › Article › peer-review

Online availability

@article{d90c5d1807b44ab5941c47a01eeaa4c1,

title = "Graphs without short odd cycles are nearly bipartite",

author = "Ervin Gy{\"o}ri and Kostochka, \{Alexandr V.\} and \{L uczak\}, Tomasz",

year = "1997",

doi = "10.1016/0012-365X(95)00321-M",

language = "English (US)",

volume = "163",

pages = "279--284",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier B.V.",

number = "1-3",

}