Back to Search
Start Over
Quadratic Upper Bounds on the Erdős-Pósa Property for a Generalization of Packing and Covering Cycles.
- Source :
-
Journal of Graph Theory . Dec2013, Vol. 74 Issue 4, p417-424. 8p. - Publication Year :
- 2013
-
Abstract
- According to the classical Erdős-Pósa theorem, given a positive integer k, every graph G either contains k vertex disjoint cycles or a set of at most [ABSTRACT FROM AUTHOR]
- Subjects :
- *MATHEMATICS theorems
*INTEGERS
*GRAPH theory
*PLANAR graphs
*SUBGRAPHS
Subjects
Details
- Language :
- English
- ISSN :
- 03649024
- Volume :
- 74
- Issue :
- 4
- Database :
- Academic Search Index
- Journal :
- Journal of Graph Theory
- Publication Type :
- Academic Journal
- Accession number :
- 91666513
- Full Text :
- https://doi.org/10.1002/jgt.21720