A bound on the chromatic number using the longest odd cycle length

By Sreyash Kenkre, S. V. N. Vishwanathan. 2007

61 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics

View Paper: https://www.semanticscholar.org/paper/2536aaa88e40e5724a5a23b9ad07e95cfccb7e41

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

1. Ladislav Stacho
2. Daniel Král

Citations in the corpus

• Coloring plane graphs with independent crossings (2010, background): “The result of Erdős and Hajnal has recently been refined by excluding large cliques [4].”