F-factors of graphs: A generalized matching problem (Q1135864): Difference between revisions
From MaRDI portal
Created claim: MaRDI profile type (P1460): MaRDI publication profile (Q5976449), #quickstatements; #temporary_batch_1710434565540 |
Set OpenAlex properties. |
||
| 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 | |||
Revision as of 23:52, 19 March 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
