"An accessibility theorem for infinite graph minors."

Reinhard Diestel (2000)

Details and statistics

DOI: 10.1002/1097-0118(200012)35:4<273::AID-JGT4>3.0.CO;2-B

access: closed

type: Journal Article

metadata version: 2020-10-02

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.