ICAR Research Data Repository for Knowledge Management
Cycles of Even Lengths Modulo k
DSpace at IIT Bombay
View Archive Info| Field | Value | |
| Title |
Cycles of Even Lengths Modulo k
|
|
| Creator |
DIWAN, AA
|
|
| Subject |
graphs
cycle lengths minimum degree |
|
| Description |
Thomassen [J Graph Theory 7 (1983), 261-271] conjectured that for all positive integers k and m, every graph of minimum degree at least k + 1 contains a cycle of length congruent to 2m modulo k. We prove that this is true for k >= 2 if the minimum degree is at least 2k - 1, which improves the previously known bound of 3k - 2. We also show that Thomassen's conjecture is true for m = 2. (C) 2010 . J Graph Theory 65: 246-252, 2010
|
|
| Publisher |
JOHN WILEY & SONS INC
|
|
| Date |
2011-08-04T12:50:58Z
2011-12-26T12:54:43Z 2011-12-27T05:42:56Z 2011-08-04T12:50:58Z 2011-12-26T12:54:43Z 2011-12-27T05:42:56Z 2010 |
|
| Type |
Article
|
|
| Identifier |
JOURNAL OF GRAPH THEORY, 65(3), 246-252
0364-9024 http://dx.doi.org/10.1002/jgt.20477 http://dspace.library.iitb.ac.in/xmlui/handle/10054/9365 http://hdl.handle.net/10054/9365 |
|
| Language |
en
|
|