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
Weighted efficient domination for some classes of H-free and of (H1, H2)-free graphs
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… 
2017
2017
Designing oil palm landscapes to retain biodiversity using insights from a key ecological indicator group
Oil palm expansion threatens biodiverse ecosystems across the tropics. However, palm oil is a widely used and profitable crop, so… 
2015
2015
Structure of Schnyder labelings on orientable surfaces
We propose a simple generalization of Schnyder woods from the plane to maps on orientable surfaces of higher genus. This is done… 
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… 
2011
2011
The solar photospheric-to-coronal Fe abundance ratio from X-ray fluorescence lines
The ratio of the Fe abundance in the photosphere to that in coronal flare plasmas is determined by X-ray lines within the complex… 
2010
2010
The Ramsey Number for a Linear Forest versus Two identical Copies of Complete Graphs
Let H be a graph with the chromatic number h and the chromatic surplus s. A connected graph G of order n is called H-good if R(G… 
2008
2008
A NOTE ON A CONJECTURE OF HANSEN ET
Conjecture number 747 of Graffiti (circa 1992) states that the average distance of a simple, connected graph is not more than… 
2007
2007
Acyclic Edge Colouring of Outerplanar Graphs
An acyclicedge colouring of a graph is a proper edge colouring having no 2-coloured cycle, that is, a colouring in which the… 
2004
2004
Maximum Induced Linear Forests in Outerplanar Graphs
Abstract.Every simple n–vertex outerplanar graph has an induced subgraph with at least vertices that is a linear forest, and this… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)