Graphs with bounded tree-width and large odd-girth are almost bipartite

Alexandr V. Kostochka, Daniel Král', Jean Sébastien Sereni, Michael Stiebitz

Research output: Contribution to journalArticlepeer-review

Fingerprint

Dive into the research topics of 'Graphs with bounded tree-width and large odd-girth are almost bipartite'. Together they form a unique fingerprint.

Keyphrases

Mathematics