Decomposing a graph into pseudoforests with one having bounded degree (Q490985)
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: Decomposing a graph into pseudoforests with one having bounded degree |
scientific article; zbMATH DE number 6474973
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Decomposing a graph into pseudoforests with one having bounded degree |
scientific article; zbMATH DE number 6474973 |
Statements
Decomposing a graph into pseudoforests with one having bounded degree (English)
0 references
21 August 2015
0 references
decomposition of graphs
0 references
maximum average degree of a graph
0 references
maximum outdegree of an oriented graph
0 references
pseudoforest
0 references
nine dragon tree conjecture
0 references
0 references
0 references
0.8925527930259705
0 references
0.812853217124939
0 references
0.8010922074317932
0 references
0.7982381582260132
0 references
0.7967101335525513
0 references
