Minor-equivalence for infinite graphs

DOI10.1016/S0012-365X(98)00126-5zbMATH Open0933.05141OpenAlexW2030700403MaRDI QIDQ1296983FDOQ1296983

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)

Cites Work

• Title not available (Why is that?)
• Quickly excluding a planar graph
• Über unendliche Wege in Graphen
• A counterexample to Seymour's self‐minor conjecture
• Excluding infinite clique minors
• Title not available (Why is that?)

Cited In (6)

• An accessibility theorem for infinite graph minors
• Title not available (Why is that?)
• 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

   Recommendations

• An accessibility theorem for infinite graph minors 👍 👎
• Title not available (Why is that?) 👍 👎
• 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 👍 👎

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)