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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
We show that every graph is spectrally similar to the union of a constant number of forests. Moreover, we show that Spielman… (More)
Is this relevant?
2008
2008
HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they… (More)
Is this relevant?
2008
2008
The vertex-arboricity a(G) of a graph G is the minimum number of subsets into which the set of vertices of G can be partitioned… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2007
2007
We solve a conjecture of Roditty, Shoham and Yuster [P.J. Cameron (Ed.), Problems from the 17th British Combinatorial Conference… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2006
2006
A known approach of detecting dense subgraphs (communities) in large sparse graphs involves first computing the probability… (More)
  • figure 1
Is this relevant?
2002
2002
The aim of this paper is to give several characterizations for the following two classes of graphs: (i) graphs for which adding… (More)
Is this relevant?
Highly Cited
1994
Highly Cited
1994
In graphs of bounded arboricity, the total complexity of all maximal complete bipartite subgraphs is O(n). We describe a linear… (More)
Is this relevant?
1994
1994
Edge-intersection graphs of paths in grids are graphs that can be represented with vertices as paths in grids and edges between… (More)
  • figure 2
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
1985
Highly Cited
1985
In this paper we introduce a new simple strategy into edge-searching of a graph, which is useful to the various subgraph listing… (More)
  • figure 1
Is this relevant?
1984
1984
‘In general, we follow the graph-theor~.tical tamino~ogy of [3]. A hem-kforest of an undirected graph G is a subgra:?h of G wheie… (More)
  • figure 2
Is this relevant?