Some improved bounds on the number of 1-factors of n-connected graphs (Q1237991): 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(76)90006-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2078735406 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the 1-factors of a non-separable graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Parallel concepts in graph theory / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the 1-factors of n-connected graphs / rank | |||
Normal rank | |||
Latest revision as of 20:26, 12 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Some improved bounds on the number of 1-factors of n-connected graphs |
scientific article |
Statements
Some improved bounds on the number of 1-factors of n-connected graphs (English)
0 references
1976
0 references
