Bounding the number of cycles in a graph in terms of its degree sequence (Q2225410)
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 7307243
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bounding the number of cycles in a graph in terms of its degree sequence |
scientific article; zbMATH DE number 7307243 |
Statements
Bounding the number of cycles in a graph in terms of its degree sequence (English)
0 references
8 February 2021
0 references
multigraphs
0 references
0.7973073720932007
0 references
0.7954398989677429
0 references
0.7951831817626953
0 references
0.7858929634094238
0 references
