Author:
Diwan Ajit A.,Kenkre Sreyash,Vishwanathan Sundar
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference16 articles.
1. T. Cormen, Ch. Leiserson, R. Rivest, C. Stein: Introduction To Algorithms — Second Edition, The MIT Press, 2001.
2. P. Erdős, R. J. Faudree, C. C. Rousseau, R. H. Schelp: The number of cycle lengths in graphs of given minimum degree and girth, Discrete Mathematics 200 (1999) 55–60.
3. A. Gyárfás: Graphs with k odd cycle lengths, Discrete Mathematics 103 (1992) 41–48.
4. M. Halldórsson, M. Szegedy: Lower Bounds for On-Line Graph Coloring, Symposium on Discrete Algorithms, SODA, 211–216, (1992).
5. S. Kenkre, S. Vishwanathan: A Bound On The Chromatic Number Using The Longest Odd Cycle Length, Journal of Graph Theory 54(4) (2007), 267–276.
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Congruence of cycle lengths and chromatic number;Journal of Graph Theory;2023-09-28
2. Cycles and new bounds for the chromatic number;Discrete Mathematics;2023-03
3. Cycles in Color-Critical Graphs;The Electronic Journal of Combinatorics;2021-12-03
4. Cycle lengths and minimum degree of graphs;Journal of Combinatorial Theory, Series B;2018-01
5. Coloring digraphs with forbidden cycles;Journal of Combinatorial Theory, Series B;2015-11