On immersions of uncountable graphs

DOI10.1016/S0095-8956(02)00030-8MaRDI QIDQ1403913zbMATH OpenFDO

Authors Thomas Andreae

Publication date 20 August 2003

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0095-8956(02)00030-8

zbMATH Keywords

AntichainsImmersion relationInfinite graphsWell-quasi-ordering

Mathematics Subject Classification ID

Graph theory (05C99) Ordered sets (06A99)

Recommendations

• Graph minors XXIII. Nash-Williams' immersion conjecture
• On well-quasi-ordering-finite graphs by immersion
• Well-quasi-ordering digraphs with no long alternating paths by the strong immersion relation
• On the immersion relation and an embedding problem for infinite graphs
• scientific article; zbMATH DE number 4002134

Cites work

• A counter-example to ‘Wagner's conjecture’ for infinite graphs
• A Glance at Graph Theory-Part II
• Graph minors. XX: Wagner's conjecture
• scientific article; zbMATH DE number 1432797 (Why is no real title available?)
• scientific article; zbMATH DE number 3232673 (Why is no real title available?)
• Well-Quasi-Ordering Infinite Graphs with Forbidden Finite Planar Minor

Cited in

(10)

• On well-quasi-ordering-finite graphs by immersion
• On the immersion relation and an embedding problem for infinite graphs
• Well-quasi-ordering digraphs with no long alternating paths by the strong immersion relation
• The countable character of uncountable graphs
• On self‐immersions of infinite graphs
• scientific article; zbMATH DE number 475612 (Why is no real title available?)
• scientific article; zbMATH DE number 1941338 (Why is no real title available?)
• A note on immersion intertwines of infinite graphs
• A weak immersion relation on graphs and its applications
• Graph minors XXIII. Nash-Williams' immersion conjecture

This page was built for publication: On immersions of uncountable graphs

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