Rizzi, Romeo (1999) König's Edge Coloring Theorem without augmenting paths. UNSPECIFIED.
![[img]](http://eprints.biblio.unitn.it/style/images/fileicons/application_pdf.png)
| PDF Download (132Kb) | Preview |
Abstract
We give a simple, self-contained proof of the following basic fact in matching theory: every bipartite regular multigraph is factorizable.
| Item Type: | Departmental Technical Report |
|---|---|
| Department or Research center: | Information Engineering and Computer Science |
| Subjects: | Q Science > QA Mathematics > QA075 Electronic computers. Computer science |
| Uncontrolled Keywords: | matching theory, edge-coloring |
| Additional Information: | Published in: "Journal of Graph Theory" vol. 29 (1998) 87. |
| Report Number: | DIT-02-057 |
| Repository staff approval on: | 21 Jan 2003 |
Actions (login required)
| View Item |
