Online coloring graphs with high girth and high odd girth
From MaRDI portal
Publication:974990
DOI10.1016/j.orl.2009.12.005zbMath1209.05096arXiv0907.3420OpenAlexW2066324788MaRDI QIDQ974990
Publication date: 8 June 2010
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0907.3420
Cites Work
- An on-line graph coloring algorithm with sublinear performance ratio
- On-line coloring \(k\)-colorable graphs
- Coloring graphs without short non-bounding cycles
- The independence number of graphs with large odd girth
- The chromatic number of a graph of girth 5 on a fixed surface
- Graph Theory and Probability
- On-line and first fit colorings of graphs
- Acyclic Colourings of Planar Graphs with Large Girth
- Randomized online graph coloring
- Coloring graphs with fixed genus and girth
This page was built for publication: Online coloring graphs with high girth and high odd girth
