Source: wikibot/kotzig-s-theorem

= Kotzig's theorem
{wiki=Kotzig's_theorem}

Kotzig's theorem is a result in graph theory concerning the properties of certain types of graphs, particularly related to edge colorings. Specifically, it states that every connected graph with a minimum degree of at least 3 can be decomposed into two spanning trees. This result is significant because spanning trees are foundational structures in graph theory, and their decomposition has implications for network design and reliability.