"Edmonds' Branching Theorem in Digraphs Without Forward-Infinite Paths."

Attila Joó (2016)

> Home

Details and statistics

DOI: 10.1002/JGT.22001

access: closed

type: Journal Article

metadata version: 2020-10-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jgt/Joo16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jgt/Joo16
Attila Joó:
Edmonds' Branching Theorem in Digraphs Without Forward-Infinite Paths. J. Graph Theory 83(3): 303-311 (2016)

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.