Almost \(H\)-factors in dense graphs (Q1196560): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (5 intermediate revisions by 4 users not shown) | |||
| Property / author | |||
| Property / author: Noga Alon / rank | |||
| Property / author | |||
| Property / author: Noga Alon / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the maximal number of independent circuits in a graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4200109 / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf02350627 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2062435485 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 11:11, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Almost \(H\)-factors in dense graphs |
scientific article |
Statements
Almost \(H\)-factors in dense graphs (English)
0 references
16 January 1993
0 references
\(H\)-factors
0 references
dense graphs
0 references
