AbstractEvery infinite locally finite graph with exactly one 1-factor is at most 2-connected is shown. More generally a lower bound for the number of 1-factors in locally finite n-connected graphs is given

Bry, François

CiteSeerX

English

Distinct representatives of subsets,

Graphes et Hypergraphes,&quot; 2nd ed., Dunod.

I-Faktoren von Graphen,

Maximale Systeme unabhängiger Kanten,

On the 1-factors of a non-separable graph,

On the I-factors of n-connected graphs,

On the structure of factorizable graphs,

The Edmonds-Gallai Decomposition for Matchings in Locally Finite graphs, Combinotorica,

The factorization of locally finite graphs,

Über die Anzahl der I-Faktoren in 2-fach zusammenhängenden

Z te6rie konecnych grafov s Iynearnym faktorom 1I,

On the Number of 1-Factors of Locally Finite Graphs