Graphs Having (2 mod d)-Cycles

Barefoot, 1988, Cycles of Length 0 Modulo 3 in Graphs, Graph Theory, Computing and Applications, 1, 87 Bollobas, 1977, Cycles Modulo k, Bulletin of the London Mathematical Society, 9, 97, 10.1112/blms/9.1.97 Cai, 1998, (1 mod 3)-cycles, Congressus Numerantium, 135, 179 4. X. Cai and W. E. Shreve, Pancyclicity mod k of Claw-Free Graphs and K1,4-free Graphs (pre-print). Chen, 1993, Cycles of Length 2 mod k, Congressus Numerantum, 93, 177 Chen, 1994, Graphs with a Cycle of Length Divisible by Three, Journal of Combinatorial Theory, Series, B 60, 277, 10.1006/jctb.1994.1019 Dean, 1991, Which Graphs are Pancyclic Modulo k?, Graph Theory, Combinatorics and Applications, 1, 315 Dean, 1991, Cycles Modulo 3, DIMACS Tech Report, 91–32 Dean, 1993, Cycles of length 0 modulo 4 in graphs, Discrete Math, 121, 37, 10.1016/0012-365X(93)90535-2 DeBose, 1996, Graphs Having No Short Even Cycles, Congressus Numerantium, 121, 243 Diestel, 1997 Erdös, 1976, Some Recent Problem and Results in Graph Theory, Combinatorics and Number Theory, Congress Numerantium, 17, 3 Saito, 1992, Cycles of Length 2 Modulo 3 in Graphs, Discrete Math, 101, 285, 10.1016/0012-365X(92)90609-J Shauger, 1998, Results on the Erdös-Gyárfás conjecture in K1,m-free Graphs, Congressus Numerantium, 134, 61 Thomassen, 1983, Graph Decomposition with Applications to Subdivisions and Path Systems Modulo k, Journal of Graph Theory, 7, 261, 10.1002/jgt.3190070215