Excluded $t$-Factors in Bipartite Graphs: Unified Framework for Nonbipartite Matchings, Restricted 2-Matchings, and Matroids (Q5067424)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Excluded t-Factors in Bipartite Graphs: Unified Framework for Nonbipartite Matchings, Restricted 2-Matchings, and Matroids |
scientific article; zbMATH DE number 7501964
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Excluded $t$-Factors in Bipartite Graphs: Unified Framework for Nonbipartite Matchings, Restricted 2-Matchings, and Matroids |
scientific article; zbMATH DE number 7501964 |
Statements
Excluded $t$-Factors in Bipartite Graphs: Unified Framework for Nonbipartite Matchings, Restricted 2-Matchings, and Matroids (English)
0 references
1 April 2022
0 references
combinatorial algorithm
0 references
dual integral system
0 references
restricted 2-matching
0 references
nonbipartite matching
0 references
matroid
0 references
0 references
0 references
0 references
0.9909067
0 references
0.8998489
0 references
0.8838811
0 references
0.85741967
0 references
0.85667914
0 references
0.85611117
0 references
0.85485697
0 references
