Highly connected hypergraphs containing no two edge-disjoint spanning connected subhypergraphs

Jørgen Bang-Jensen, Stéphan Thomassé. Highly connected hypergraphs containing no two edge-disjoint spanning connected subhypergraphs. Discrete Applied Mathematics, 131(2):555-559, 2003. [doi]

@article{Bang-JensenT03,
  title = {Highly connected hypergraphs containing no two edge-disjoint spanning connected subhypergraphs},
  author = {Jørgen Bang-Jensen and Stéphan Thomassé},
  year = {2003},
  doi = {10.1016/S0166-218X(02)00582-6},
  url = {http://dx.doi.org/10.1016/S0166-218X(02)00582-6},
  researchr = {https://researchr.org/publication/Bang-JensenT03},
  cites = {0},
  citedby = {0},
  journal = {Discrete Applied Mathematics},
  volume = {131},
  number = {2},
  pages = {555-559},
}