Skip to search formSkip to main contentSkip to account menu

Arboricity

Known as: Anarboricity, Schnyder wood, Star arboricity 
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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

22 relations
AlgorithmicaArthur Hobbs (mathematician)Clique problemDegeneracy (graph theory)

Broader (1)

Spanning tree

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
The Partition Spanning Forest Problem
Given a set of colored points in the plane, we ask if there exists a crossing-free straight-line drawing of a spanning forest… 
2018
2018
Constant Arboricity Spectral Sparsifiers
We show that every graph is spectrally similar to the union of a constant number of forests. Moreover, we show that Spielman… 
2017
2017
Fast Residual Forests: Rapid Ensemble Learning for Semantic Segmentation
In recent times, Convolutional Neural Network (CNN) based approaches have performed exceptionally well in many computer vision… 
2016
2016
A note on vertex arboricity of toroidal graphs without 7-cycles
The vertex arboricity ρ(G) of a graph G is the minimum number of subsets into which the vertex set V (G) can be partitioned so… 
2014
2014
Morphing planar triangulations
A morph between two drawings of the same graph can be thought of as a continuous deformation between the two given drawings. A… 
2012
2012
A Simple Research of Divisor Graphs
Let S be a finite, nonempty set of positive integers. Then, the divisor graph ) (S D of S has S as its vertex set, and vertices i… 
1999
1999
ALGORITHMIC ASPECTS OF LINEAR k-ARBORICITY
For a fixed positive integer $k$, the linear $k$-arboricity $\rm la_k(G)$ of a graph $G$ is the minimum number $\ell$ such that… 
1999
1999
On the vertex arboricity of graphs with prescribed size
ON THE VERTEX ARBORICITY OF GRAPHS WITH PRESCRIBED SIZE Nirmala Achuthan, N.R. Achuthan and L. Caccetta School of Mathematics and… 
1997
1997
Competitive Call Control in Mobile Networks
In this paper, we deal with competitive local on-line algorithms for non-preemptive channel allocation in mobile networks. The… 
1997
1997
Parallel Algorithms for Maximal Linear Forests
The maximal linear forest problem is to nd, given a graph G = (V;E), a maximal subset of V that induces a linear forest. Three…