Pages that link to "Item:Q800941"
From MaRDI portal
The following pages link to A generalization of Tutte's 1-factor theorem to countable graphs (Q800941):
Displaying 12 items.
- Proof of a theorem of Tutte using permanents (Q277516) (← links)
- Generalizing Tutte's theorem and maximal non-matchable graphs (Q390291) (← links)
- LP duality in infinite hypergraphs (Q803165) (← links)
- Graph factors and factorization: 1985--2003: a survey (Q868347) (← links)
- Faktoren in unendlichen Graphen. (Factors in infinite graphs) (Q1066919) (← links)
- Maximal tight sets and the Edmonds-Gallai decomposition for matchings (Q1086254) (← links)
- Matchings in infinite graphs (Q1101134) (← links)
- Infinite matching theory (Q1191911) (← links)
- The Lovász-Cherkassky theorem in countable graphs (Q2680564) (← links)
- Strict matching matroids and matroid algorithms (Q3744174) (← links)
- (Q3791183) (← links)
- A generalization of Smith's theorem (Q3971917) (← links)