Characterization of 1-tough graphs using factors (Q2185904)
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 7209401
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Characterization of 1-tough graphs using factors |
scientific article; zbMATH DE number 7209401 |
Statements
Characterization of 1-tough graphs using factors (English)
0 references
8 June 2020
0 references
tough
0 references
factor
0 references
parity factor
0 references
0.8083396553993225
0 references
0.7865926623344421
0 references
0.7855767011642456
0 references
0.7845710515975952
0 references
