Record Details

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

DSpace at IIT Bombay

View Archive Info
 
 
Field Value
 
Title A bound on the chromatic number using the longest odd cycle length
 
Creator KENKRE, S
VISHWANATHAN, S
 
Subject graphs
graph coloring
chromatic number
odd cycles
 
Description Let G be a non-bipartite graph with l as the length of the longest odd cycle. Erdos and Hajnal proved that chi(G)
 
Publisher JOHN WILEY & SONS INC
 
Date 2011-08-04T09:24:27Z
2011-12-26T12:54:39Z
2011-12-27T05:42:47Z
2011-08-04T09:24:27Z
2011-12-26T12:54:39Z
2011-12-27T05:42:47Z
2007
 
Type Article
 
Identifier JOURNAL OF GRAPH THEORY, 54(4), 267-276
0364-9024
http://dx.doi.org/10.1002/jgt.20209
http://dspace.library.iitb.ac.in/xmlui/handle/10054/9313
http://hdl.handle.net/10054/9313
 
Language en