Amanote Research
Register
Sign In
Well-Quasi-Ordering Infinite Graphs With Forbidden Finite Planar Minor
Transactions of the American Mathematical Society
- United States
doi 10.2307/2001217
Full Text
Open PDF
Abstract
Available in
full text
Categories
Mathematics
Applied Mathematics
Date
March 1, 1989
Authors
Robin Thomas
Publisher
JSTOR
Related search
Forbidden Structures for Planar Perfect Consecutively Colourable Graphs
Discussiones Mathematicae - Graph Theory
Combinatorics
Applied Mathematics
Discrete Mathematics
Fast Minor Testing in Planar Graphs
Algorithmica
Applied Mathematics
Computer Science Applications
Computer Science
Infinite Locally Finite Hypohamiltonian Graphs.
Mathematica Scandinavica
Mathematics
Uniquely Partitionable Planar Graphs With Respect to Properties Having a Forbidden Tree
Discussiones Mathematicae - Graph Theory
Combinatorics
Applied Mathematics
Discrete Mathematics
Projective-Planar Graphs With No K 3, 4 -Minor. II
Journal of Graph Theory
Geometry
Topology
Infinite Highly Connected Planar Graphs of Large Girth
Abhandlungen aus dem Mathematischen Seminar der Universitat Hamburg
Mathematics
Constant Memory Routing in Quasi-Planar and Quasi-Polyhedral Graphs
Discrete Applied Mathematics
Combinatorics
Applied Mathematics
Discrete Mathematics
On the Relationship Between K-Planar and K-Quasi-Planar Graphs
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Hitting Topological Minor Models in Planar Graphs Is Fixed Parameter Tractable
