We give a simple, self-contained proof of the following basic fact in matching theory: every bipartite regular multigraph is factorizable.
König's Edge Coloring Theorem without augmenting paths / Rizzi, Romeo. - ELETTRONICO. - (1999), pp. 1-1.
König's Edge Coloring Theorem without augmenting paths
Rizzi, Romeo
1999-01-01
Abstract
We give a simple, self-contained proof of the following basic fact in matching theory: every bipartite regular multigraph is factorizable.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
tec57.pdf
accesso aperto
Tipologia:
Versione editoriale (Publisher’s layout)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
132.94 kB
Formato
Adobe PDF
|
132.94 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione
