The 3‐connected graphs with a maximum matching containing precisely one contractible edge (Q4277986)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 490725
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The 3‐connected graphs with a maximum matching containing precisely one contractible edge |
scientific article; zbMATH DE number 490725 |
Statements
The 3‐connected graphs with a maximum matching containing precisely one contractible edge (English)
0 references
29 August 1994
0 references
3-connected graph
0 references
maximum matching
0 references
contractible edge
0 references
characterization
0 references
0.9408193230628968
0 references
0.8540488481521606
0 references
0.8515303730964661
0 references
