| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4656902 | Journal of Combinatorial Theory, Series B | 2014 | 4 Pages |
Abstract
We prove a general result on graph factors modulo k. A special case says that, for each natural number k , every (12k−7)(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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Carsten Thomassen,