Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Arboricity and complement of a graph

Arboricity and complement of a graph The arboricity of graphG=(V,E), denoted bya (G), is defined asa(G)=min{n|E can be partitioned inton subsetsE 1,E 2, ...,E n, such that each subset spans a subgraph ofG so as to be a forest}. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Acta Mathematicae Applicatae Sinica Springer Journals

Loading next page...
 
/lp/springer-journals/arboricity-and-complement-of-a-graph-X9wpUW1lUc
Publisher
Springer Journals
Copyright
Copyright © 1998 by Science Press
Subject
Mathematics; Applications of Mathematics; Math Applications in Computer Science; Theoretical, Mathematical and Computational Physics
ISSN
0168-9673
eISSN
1618-3932
DOI
10.1007/BF02677345
Publisher site
See Article on Publisher Site

Abstract

The arboricity of graphG=(V,E), denoted bya (G), is defined asa(G)=min{n|E can be partitioned inton subsetsE 1,E 2, ...,E n, such that each subset spans a subgraph ofG so as to be a forest}.

Journal

Acta Mathematicae Applicatae SinicaSpringer Journals

Published: Jul 3, 2007

References