F-factors of graphs: A generalized matching problem (Q1135864): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(79)90026-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1493768132 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3941433 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Bestimmung eines maximalen Matching in beliebigen Graphen / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4193520 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5762903 / rank | |||
Normal rank | |||
Latest revision as of 03:10, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | F-factors of graphs: A generalized matching problem |
scientific article |
Statements
F-factors of graphs: A generalized matching problem (English)
0 references
1979
0 references
F-factor
0 references
magic squares
0 references
bipartite graphs
0 references
perfect matchings
0 references
