Minor-equivalence for infinite graphs

DOI10.1016/S0012-365X(98)00126-5MaRDI QIDQ1296983zbMATH OpenOpenAlexFDO

Authors Bogdan Oporowski

Publication date 3 August 1999

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0012-365x(98)00126-5

zbMATH Keywords

characterizationsminor equivalence

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Structural characterization of families of graphs (05C75) Graph minors (05C83)

Recommendations

• An accessibility theorem for infinite graph minors
• scientific article; zbMATH DE number 1057880
• The relative degree and large complete minors in infinite graphs
• On a minor-monotone graph invariant
• Unavoidable topological minors of infinite graphs
• Forcing large complete (topological) minors in infinite graphs
• On Ramsey-minimal infinite graphs
• Graph minor theory
• Minors in graphs of large girth
• Forcing finite minors in sparse infinite graphs by large-degree assumptions

Cites work

• scientific article; zbMATH DE number 3882430 (Why is no real title available?)
• scientific article; zbMATH DE number 475606 (Why is no real title available?)
• A counterexample to Seymour's self‐minor conjecture
• Excluding infinite clique minors
• Quickly excluding a planar graph
• Über unendliche Wege in Graphen

Cited in

(7)

• An accessibility theorem for infinite graph minors
• scientific article; zbMATH DE number 1057880 (Why is no real title available?)
• On a minor-monotone graph invariant
• Well-Quasi-Ordering Infinite Graphs with Forbidden Finite Planar Minor
• Small cancellation labellings of some infinite graphs and applications
• Twins of rayless graphs
• Excluding a full grid minor

This page was built for publication: Minor-equivalence for infinite graphs

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