Arboricity
id:
arboricity-307-15236175
title:
Arboricity
text:
The arboricity of an undirected graph is the minimum number of forests into which its edges can be partitioned. Equivalently it is the minimum number of spanning forests needed to cover all the edges of the graph. The Nash-Williams theorem provides necessary and sufficient conditions for when a graph is k-arboric.
brand slug:
wiki
category slug:
encyclopedia
description:
Number of forests a graph's edges may be partitioned into
original url:
https://en.wikipedia.org/wiki/Arboricity
date created:
date modified:
2023-12-31T18:01:22Z
main entity:
{"identifier":"Q4784907","url":"https://www.wikidata.org/entity/Q4784907"}
image:
fields total:
13
integrity:
14