# Arboricity

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2018

2018

- ArXiv
- 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

- Discrete Mathematics
- 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

- Eur. J. Comb.
- 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)

Is this relevant?

2007

2007

- Discrete Mathematics
- 2007

We solve a conjecture of Roditty, Shoham and Yuster [P.J. Cameron (Ed.), Problems from the 17th British Combinatorial Conferenceâ€¦Â (More)

Is this relevant?

2006

2006

- WG
- 2006

A known approach of detecting dense subgraphs (communities) in large sparse graphs involves first computing the probabilityâ€¦Â (More)

Is this relevant?

2002

2002

- Ars Comb.
- 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

- Inf. Process. Lett.
- 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

- Graph Drawing
- 1994

Edge-intersection graphs of paths in grids are graphs that can be represented with vertices as paths in grids and edges betweenâ€¦Â (More)

Is this relevant?

Highly Cited

1985

Highly Cited

1985

- SIAM J. Comput.
- 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)

Is this relevant?

1984

1984

- Discrete Mathematics
- 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)

Is this relevant?