Maximising the number of induced cycles in a graph (Q2399349)
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 6763481
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Maximising the number of induced cycles in a graph |
scientific article; zbMATH DE number 6763481 |
Statements
Maximising the number of induced cycles in a graph (English)
0 references
22 August 2017
0 references
induced subgraphs
0 references
holes
0 references
inducibility
0 references
0.8297582268714905
0 references
0.8208779692649841
0 references
0.8101279735565186
0 references
0.8051176071166992
0 references
0.8012016415596008
0 references
