Year: 2014
Type: preprint
Abstract: A new shortest proof of Kotzig's Theorem about graphs with unique perfect matching is presented in this paper. It is well known that Kotzig's theorem is a consequence of Yeo's Theorem about edge-colored graph without alternating cycle. We present a proof of Yeo's Theorem based on the same ideas as our proof of Kotzig's theorem.
Source: arXiv (Cornell University)
Author: Nenashev, Gleb
Institution: St Petersburg University
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W233256833