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

Alexandr V. Kostochka et al. (2010)

> Home

Details and statistics

DOI: 10.1016/J.JCTB.2010.04.004

access: open

type: Journal Article

metadata version: 2024-06-07

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/jct/KostochkaKSS10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jct/KostochkaKSS10
Alexandr V. Kostochka, Daniel Král', Jean-Sébastien Sereni, Michael Stiebitz:
Graphs with bounded tree-width and large odd-girth are almost bipartite. J. Comb. Theory B 100(6): 554-559 (2010)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.