Circumference, chromatic number and online coloring
From MaRDI portal
Publication:2439828
DOI10.1007/s00493-013-2542-9zbMath1313.05115arXiv0809.1710MaRDI QIDQ2439828
Ajit A. Diwan, Sreyash Kenkre, Sundar Vishwanathan
Publication date: 17 March 2014
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0809.1710
Related Items
Coloring digraphs with forbidden cycles, Cycle lengths and minimum degree of graphs, Cycles and new bounds for the chromatic number, Cycles in color-critical graphs, Lower Bounds for On-line Graph Colorings
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Graph coloring in linear time
- Cycle lengths in sparse graphs
- An on-line graph coloring algorithm with sublinear performance ratio
- Graphs with \(k\) odd cycle lengths
- On-line coloring \(k\)-colorable graphs
- The number of cycle lengths in graphs of given minimum degree and girth
- Chromatic number of graphs each path of which is 3-colourable
- Cycle lengths and chromatic number of graphs
- Triangle-free graphs with large chromatic numbers
- Cycle length parities and the chromatic number
- A bound on the chromatic number using the longest odd cycle length