Decomposition of sparse graphs into two forests, one having bounded maximum degree (Q407602)
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: Decomposition of sparse graphs into two forests, one having bounded maximum degree |
scientific article; zbMATH DE number 6018501
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Decomposition of sparse graphs into two forests, one having bounded maximum degree |
scientific article; zbMATH DE number 6018501 |
Statements
Decomposition of sparse graphs into two forests, one having bounded maximum degree (English)
0 references
27 March 2012
0 references
maximum average degree
0 references
mad
0 references
combinatorial problems
0 references
edge partition
0 references
decomposition
0 references
forest with bounded degree
0 references
discharging procedure
0 references
global rules
0 references
0 references
0.8365961313247681
0 references
0.8316310048103333
0 references
0.826205849647522
0 references
0.7983101606369019
0 references
