A new proof and generalizations of a theorem of Erdős and Pósa on graphs withoutk+1 independent circuits (Q5538409): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On Independent Circuits Contained in a Graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Maximum-Minimum Sätze und verallgemeinerte Faktoren von Graphen / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf02020974 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2020381865 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 09:23, 30 July 2024
scientific article; zbMATH DE number 3249674
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new proof and generalizations of a theorem of Erdős and Pósa on graphs withoutk+1 independent circuits |
scientific article; zbMATH DE number 3249674 |
Statements
A new proof and generalizations of a theorem of Erdős and Pósa on graphs withoutk+1 independent circuits (English)
0 references
1967
0 references
topology
0 references
