Algorithmic proofs of two relations between connectivity and the 1- factors of a graph (Q1153100)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Algorithmic proofs of two relations between connectivity and the 1- factors of a graph |
scientific article; zbMATH DE number 3724502
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithmic proofs of two relations between connectivity and the 1- factors of a graph |
scientific article; zbMATH DE number 3724502 |
Statements
Algorithmic proofs of two relations between connectivity and the 1- factors of a graph (English)
0 references
1979
0 references
matched graphs
0 references
