  Graphs considered in this paper are finite, undirected and loopless, but we
allow multiple edges. The point partition number $\chi_t(G)$ is the least
integer $k$ for which $G$ admits a coloring with $k$ colors such that each
color class induces a $(t-1)$-degenerate subgraph of $G$. So $\chi_1$ is the
chromatic number and $\chi_2$ is the point aboricity. The point partition
number $\chi_t$ with $t\geq 1$ was introduced by Lick and White. A graph $G$ is
called $\chi_t$-critical if every proper subgraph $H$ of $G$ satisfies
$\chi_t(H)<\chi_t(G)$. In this paper we prove that if $G$ is a
$\chi_t$-critical graph whose order satisfies $|G|\leq 2\chi_t(G)-2$, then $G$
can be obtained from two non-empty disjoint subgraphs $G_1$ and $G_2$ by adding
$t$ edges between any pair $u,v$ of vertices with $u\in V(G_1)$ and $v\in
V(G_2)$. Based on this result we establish the minimum number of edges possible
in a $\chi_t$-critical graph $G$ of order $n$ and with $\chi_t(G)=k$, provided
that $n\leq 2k-1$ and $t$ is even. For $t=1$ the corresponding two results were
obtained in 1963 by Tibor Gallai.
