Minor-equivalence for infinite graphs

DOI10.1016/S0012-365X(98)00126-5zbMath0933.05141OpenAlexW2030700403MaRDI QIDQ1296983

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

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

Related Items (1)

Twins of rayless graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Quickly excluding a planar graph
• Über unendliche Wege in Graphen
• A counterexample to Seymour's self‐minor conjecture
• Excluding infinite clique minors

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