---
res:
  bibo_abstract:
  - "The pseudoforest version of the Strong Nine Dragon Tree Conjecture states that
    if a graph G has maximum average degree mad(G) = 2 maxH⊆G e(H)/v(H) at most 2(k
    + d/d+k+1), then it has a decomposition into k + 1 pseudoforests where in one
    pseudoforest F the components of F have at most d edges. This was proven in 2020
    in Grout and Moore (2020). We strengthen this\r\ntheorem by showing that we can
    find such a decomposition where additionally F is acyclic, the diameter of the
    components of F is at most 2ℓ + 2, where ℓ =⌊d−1/k+1⌋, and at most 2ℓ + 1 if\r\nd
    ≡ 1 mod (k + 1). Furthermore, for any component K of F and any z ∈ N, we have
    diam(K) ≤ 2z if e(K) ≥ d − z(k − 1) + 1. We also show that both diameter bounds
    are best possible as an\r\nextension for both the Strong Nine Dragon Tree Conjecture
    for pseudoforests and its original conjecture for forests. In fact, they are still
    optimal even if we only enforce F to have any constant maximum degree, instead
    of enforcing every component of F to have at most d edges.@eng"
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Sebastian
      foaf_name: Mies, Sebastian
      foaf_surname: Mies
  - foaf_Person:
      foaf_givenName: Benjamin
      foaf_name: Moore, Benjamin
      foaf_surname: Moore
      foaf_workInfoHomepage: http://www.librecat.org/personId=6dc1a1be-bf1c-11ed-8d2b-d044840f49d6
  - foaf_Person:
      foaf_givenName: Evelyne
      foaf_name: Smith-Roberge, Evelyne
      foaf_surname: Smith-Roberge
  bibo_doi: 10.1016/j.ejc.2025.104214
  bibo_issue: '12'
  bibo_volume: 130
  dct_date: 2025^xs_gYear
  dct_identifier:
  - UT:001529769300002
  dct_isPartOf:
  - http://id.crossref.org/issn/0195-6698
  dct_language: eng
  dct_publisher: Elsevier@
  dct_title: Beyond the pseudoforest strong Nine Dragon Tree theorem@
...