An accessibility theorem for infinite graph minors

DOI<link itemprop=identifier href="https://doi.org/10.1002/1097-0118(200012)35:4<273::AID-JGT4>3.0.CO;2-B" /><273::AID-JGT4>3.0.CO;2-B 10.1002/1097-0118(200012)35:4<273::AID-JGT4>3.0.CO;2-BzbMath0967.05061OpenAlexW4244017238MaRDI QIDQ4521495

Reinhard Diestel

Publication date: 30 August 2001

Full work available at URL: https://doi.org/10.1002/1097-0118(200012)35:4<273::aid-jgt4>3.0.co;2-b

zbMATH Keywords

binary treesubdivisiondyadic treeconjecture of Halininfinite graph minors

Mathematics Subject Classification ID

Trees (05C05) Graph minors (05C83)

This page was built for publication: An accessibility theorem for infinite graph minors