We give a simple, self-contained proof of the following basic fact in matching theory: Every bipartite regular multigraph is factorizable. Our proof does not use any alternating path argument.
Konig's Edge Coloring Theorem without augmenting paths
RIZZI, ROMEO
1998-01-01
Abstract
We give a simple, self-contained proof of the following basic fact in matching theory: Every bipartite regular multigraph is factorizable. Our proof does not use any alternating path argument.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
