Parallel concepts in graph theory
β
F. Harary
π
Article
π
1993
π
Elsevier Science
π
English
β 376 KB
edge of a graph G is taken as a basic unit, regarded as the set of its two nodes. Two edges are called parallel (or independent) if they are disjoint. Then a l-factor (or perfect matching) of G is a spanning set of parallel edges. A l-factorization of G is a partition of its edge set E(G) into l-fac