A simple existence criterion for \((g<f)\)-factors (Q757439): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q56688017, #quickstatements; #temporary_batch_1706437032065 |
Set OpenAlex properties. |
||
| (5 intermediate revisions by 4 users not shown) | |||
| Property / author | |||
| Property / author: David G. Kirkpatrick / rank | |||
| Property / author | |||
| Property / author: Gui Zhen Liu / rank | |||
| Property / author | |||
| Property / author: David G. Kirkpatrick / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Gui Zhen Liu / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An algorithmic proof of Tutte's f-factor theorem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Simplified existence theorems for \((g,f)\)-factors / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4156806 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Algorithms for Degree Constrained Graph Factors of Minimum Deficiency / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: [a,b]-factors of graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An extension of Tutte's 1-factor theorem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Subgraphs with prescribed valencies / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Matching theory / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A remark on the factor theorems of lovász and tutte / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Factorization of Linear Graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Subgraph Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Graph factors / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0012-365x(90)90387-w / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2082659364 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 11:01, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A simple existence criterion for \((g<f)\)-factors |
scientific article |
Statements
A simple existence criterion for \((g<f)\)-factors (English)
0 references
1990
0 references
The criterion of Lovász for the existence of a (g,f)-factor when \(g<f\), or when the graph is bipartite is simplified and a simple direct proof, implying an O(\(\sqrt{(g(V))}\cdot | E|)\) algorithm, for these cases is given.
0 references
criterion of Lovász
0 references
(g,f)-factor
0 references
algorithm
0 references
