Dense on-line arbitrarily partitionable graphs (Q2357776)
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 6730832
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Dense on-line arbitrarily partitionable graphs |
scientific article; zbMATH DE number 6730832 |
Statements
Dense on-line arbitrarily partitionable graphs (English)
0 references
14 June 2017
0 references
partitions of graphs
0 references
traceable graph
0 references
Erdős-Gallai condition
0 references
Ore condition
0 references
perfect matching
0 references
0.8966314792633057
0 references
0.8383906483650208
0 references
0.8351109623908997
0 references
0.828538715839386
0 references
0.8120970726013184
0 references
