Equating \(\kappa\) maximum degrees in graphs without short cycles (Q2175241)
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: Equating maximum degrees in graphs without short cycles |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Equating \(\kappa\) maximum degrees in graphs without short cycles |
scientific article |
Statements
Equating \(\kappa\) maximum degrees in graphs without short cycles (English)
0 references
28 April 2020
0 references
maximum degree
0 references
repeated degrees
0 references
repetition number
0 references
0.7779088020324707
0 references
0.7779049277305603
0 references
0.7776742577552795
0 references
0.7759420275688171
0 references
0.7696825265884399
0 references
