On self‐immersions of infinite graphs

DOI10.1002/JGT.20308zbMATH Open1223.05196OpenAlexW4240514097MaRDI QIDQ3630833FDOQ3630833

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

Recommendations

• On the immersion relation and an embedding problem for infinite graphs
• A counterexample to Seymour's self‐minor conjecture
• A note on intertwines of infinite graphs
• A note on immersion intertwines of infinite graphs
• On immersions of uncountable graphs

zbMATH Keywords

antichainsinfinite graphsimmersionwell-quasi-orderingSeymour's self-minor conjecture

Mathematics Subject Classification ID

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

Cites Work

• Graph minors. XX: Wagner's conjecture
• Title not available (Why is that?)
• Title not available (Why is that?)
• A counterexample to Seymour's self‐minor conjecture
• A counter-example to ‘Wagner's conjecture’ for infinite graphs
• A Glance at Graph Theory-Part II
• On immersions of uncountable graphs
• A note on minors of uncountable graphs

Cited In (4)

• On the immersion relation and an embedding problem for infinite graphs
• On a property of graphs containing infinitely many isomorphic copies of themselves
• Fixed point indices and fixed words at infinity of selfmaps of graphs. II
• Constructing graphs with no immersion of large complete graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3630833)