Let $\mathcal{H}=\{H_i: i<α\}$ be an indexed family of graphs for some ordinal number $α$. $\mathcal{H}$-decomposition of a graph $G$ is a family $\mathcal{G}=\{G_i: i<α\}$ of edge-disjoint subgraphs of $G$ such that $G_i$ is isomorphic to $H_i$ for every $i<α$ and $\bigcup\{E(G_i):i<α\}=E(G)$. $\mathcal{H}$-factorization of $G$ is a $\mathcal{H}$-decomposition of $G$ such that every element of $\mathcal{H}$ is a spanning subgraph of $G$. Let $κ$ be an infinite cardinal. Kőnig in 1936 proved that every $κ$-regular graph has a factorization into perfect matchings. Andersen and Thomassen using this theorem proved in 1980 that every $κ$-regular connected graph has a $κ$-regular spanning tree. We generalize both these results and establish the existence of a factorization of $κ$-regular graph into $λ$-regular subgraphs for every non-zero $λ\leq κ$. Furthermore, we show that every $κ$-regular connected graph has a $\mathcal{H}$-factorization for every family $\mathcal{H}$ of $κ$ forests with $κ$ components of order at most $κ$ and without isolated vertices.