It is shown that every 6-edge-connected graph admits a circulation whose range lies in the interval [1,3).
The circular flow number of a 6-edge-connected graph is less than four
Galluccio A;
2002
Abstract
It is shown that every 6-edge-connected graph admits a circulation whose range lies in the interval [1,3).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.
