On self‐immersions of infinite graphs

DOI10.1002/jgt.20308zbMath1223.05196OpenAlexW4240514097MaRDI QIDQ3630833

Thomas Andreae

Publication date: 4 June 2009

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20308

zbMATH Keywords

immersionantichainswell-quasi-orderinginfinite graphsSeymour's self-minor conjecture

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph minors (05C83) Infinite graphs (05C63)

Related Items (1)

Constructing Graphs with No Immersion of Large Complete Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Graph minors. XX: Wagner's conjecture
• On immersions of uncountable graphs
• A counter-example to ‘Wagner's conjecture’ for infinite graphs
• A Glance at Graph Theory-Part II
• A note on minors of uncountable graphs
• A counterexample to Seymour's self‐minor conjecture

This page was built for publication: On self‐immersions of infinite graphs