"Spanning trees of countable graphs omitting sets of dominated ends."

François Laviolette, Norbert Polat (1999)

> Home

Details and statistics

DOI: 10.1016/S0012-365X(98)00042-9

access: open

type: Journal Article

metadata version: 2021-02-12

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dm/LavioletteP99
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/LavioletteP99
François Laviolette, Norbert Polat:
Spanning trees of countable graphs omitting sets of dominated ends. Discret. Math. 194(1-3): 151-172 (1999)

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.