Sign Up to like & get
recommendations!
1
Published in 2019 at "Combinatorica"
DOI: 10.1007/s00493-017-3669-x
Abstract: We prove that the set of long cycles has the edge-Erdős-Pósa property: for every fixed integer ℓ ≥ 3 and every k ∈ ℕ, every graph G either contains k edge-disjoint cycles of length at…
read more here.
Keywords:
edge erd;
erd property;
cycles edge;
long cycles ... See more keywords