Dense arbitrarily partitionable graphs (Q907823)
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 6535842
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Dense arbitrarily partitionable graphs |
scientific article; zbMATH DE number 6535842 |
Statements
Dense arbitrarily partitionable graphs (English)
0 references
26 January 2016
0 references
arbitrarily partitionable graph
0 references
Erdős-Gallai condition
0 references
traceable graph
0 references
perfect matching
0 references
0.8971830010414124
0 references
0.8966314792633057
0 references
0.8762388229370117
0 references
0.876192033290863
0 references
0.8694090247154236
0 references
