(a, b)-decomposition
In graph theory, the (a, b)-decomposition of an undirected graph is a partition of its edges into a + 1 sets, each one of them inducing a forest, except one which induces a graph with maximum degree b. If this graph is also a forest, then we call this a F(a, b)-decomposition. A graph with arboricity a is (a, 0)-decomposable. Every (a, 0)-decomposition or (a, 1)-decomposition is a F(a, 0)-decomposition or a F(a, 1)-decomposition respectively.
Wikipage redirect
Link from a Wikipage to another Wikipage
primaryTopic
(a, b)-decomposition
In graph theory, the (a, b)-decomposition of an undirected graph is a partition of its edges into a + 1 sets, each one of them inducing a forest, except one which induces a graph with maximum degree b. If this graph is also a forest, then we call this a F(a, b)-decomposition. A graph with arboricity a is (a, 0)-decomposable. Every (a, 0)-decomposition or (a, 1)-decomposition is a F(a, 0)-decomposition or a F(a, 1)-decomposition respectively.
has abstract
In graph theory, the (a, b)-de ...... 1)-decomposition respectively.
@en
Link from a Wikipage to an external page
Wikipage page ID
44,538,513
page length (characters) of wiki page
Wikipage revision ID
1,018,112,675
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
comment
In graph theory, the (a, b)-de ...... 1)-decomposition respectively.
@en
label
(a, b)-decomposition
@en