Graphs with bounded tree-width and large odd-girth are almost bipartite
From MaRDI portal
Publication:602711
DOI10.1016/j.jctb.2010.04.004zbMath1222.05066arXiv0904.2282OpenAlexW2108787881WikidataQ57601430 ScholiaQ57601430MaRDI QIDQ602711
Jean-Sébastien Sereni, Michael Stiebitz, Daniel Král', Alexandr V. Kostochka
Publication date: 5 November 2010
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0904.2282
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The circular chromatic number of series-parallel graphs of large odd girth
- High-girth graphs avoiding a minor are nearly bipartite
- Extending precolorings to circular colorings
- Graph Theory and Probability
- Graph minors. II. Algorithmic aspects of tree-width
- 4-chromatic projective graphs
- (2 + ?)-Coloring of planar graphs with large odd-girth
- Circular chromatic number: A survey