Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 230,701,588 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
22 relations
Algorithmica
Arthur Hobbs (mathematician)
Clique problem
Degeneracy (graph theory)
Expand
Broader (1)
Spanning tree
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
The Partition Spanning Forest Problem
Philipp Kindermann
,
Boris Klemz
,
Ignaz Rutter
,
P. Schnider
,
A. Schulz
arXiv.org
2018
Corpus ID: 52184464
Given a set of colored points in the plane, we ask if there exists a crossing-free straight-line drawing of a spanning forest…
Expand
2017
2017
Fast Residual Forests: Rapid Ensemble Learning for Semantic Segmentation
Yan Zuo
,
T. Drummond
Conference on Robot Learning
2017
Corpus ID: 40961536
In recent times, Convolutional Neural Network (CNN) based approaches have performed exceptionally well in many computer vision…
Expand
2017
2017
Designing oil palm landscapes to retain biodiversity using insights from a key ecological indicator group
Claudia L. Gray
,
E. Slade
,
D. Mann
,
O. Lewis
bioRxiv
2017
Corpus ID: 51743976
Oil palm expansion threatens biodiverse ecosystems across the tropics. However, palm oil is a widely used and profitable crop, so…
Expand
2016
2016
k-channel connected topology control algorithm for cognitive radio networks
R. Yadav
,
R. Misra
International Conference on Communication Systems…
2016
Corpus ID: 16983979
Cognitive radio networks (CRNs) enable secondary users (SUs) to access the underutilized spectrum licensed to primary users (PUs…
Expand
2015
2015
The incidence game chromatic number of (a, d)-decomposable graphs
C. Charpentier
,
É. Sopena
J. Discrete Algorithms
2015
Corpus ID: 1102795
2012
2012
A Simple Research of Divisor Graphs
Yu-Ping Tsao
2012
Corpus ID: 18002919
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…
Expand
2011
2011
The solar photospheric-to-coronal Fe abundance ratio from X-ray fluorescence lines
K. Phillips
2011
Corpus ID: 118342252
The ratio of the Fe abundance in the photosphere to that in coronal flare plasmas is determined by X-ray lines within the complex…
Expand
2010
2010
Urban influence on changes in linear forest edge structure
T. Chant
,
A. Gallego
,
J. V. Saornil
,
M. Kelly
2010
Corpus ID: 56439955
2008
2008
Schnyder woods for higher genus triangulated surfaces (abstract)
L. C. Aleardi
,
Éric Fusy
,
T. Lewiner
Electron. Notes Discret. Math.
2008
Corpus ID: 27767538
2007
2007
On a cycle through a specified linear forest of a graph
T. Gerlach
,
J. Harant
Discrete Mathematics
2007
Corpus ID: 34057510
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)
ACCEPT & CONTINUE