@article{thomassen2014a,
title = {Graph factors modulo *k*},
language = {eng},
author = {Thomassen, Carsten},
journal = {Journal of Combinatorial Theory. Series B},
volume = {106},
pages = {174-177},
year = {2014},
issn = {10960902, 00958956},
abstract = {We prove a general result on graph factors modulo k . A special case says that, for each natural number k , every (12k−7)-edge-connected graph with an even number of vertices contains a spanning subgraph in which each vertex has degree congruent to k modulo 2k.},
doi = {10.1016/j.jctb.2014.01.002}
}