"Highly Connected Infinite Digraphs Without Edge-Disjoint Back and Forth ..."

Attila Joó (2017)

> Home

Details and statistics

DOI: 10.1002/JGT.22046

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/Joo17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jgt/Joo17
Attila Joó:
Highly Connected Infinite Digraphs Without Edge-Disjoint Back and Forth Paths Between a Certain Vertex Pair. J. Graph Theory 85(1): 51-55 (2017)

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.