default search action

combined dblp search
author search
venue search
publication search

ask others

"Highly connected hypergraphs containing no two edge-disjoint spanning ..."

Jørgen Bang-Jensen, Stéphan Thomassé (2003)

> Home

Details and statistics

DOI: 10.1016/S0166-218X(02)00582-6

access: open

type: Journal Article

metadata version: 2021-02-11

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dam/Bang-JensenT03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/Bang-JensenT03
Jørgen Bang-Jensen, Stéphan Thomassé:
Highly connected hypergraphs containing no two edge-disjoint spanning connected subhypergraphs. Discret. Appl. Math. 131(2): 555-559 (2003)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.