Well-Quasi-Ordering Infinite Graphs with Forbidden Finite Planar Minor (Q3831057): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
label / enlabel / en
 
Well-Quasi-Ordering Infinite Graphs with Forbidden Finite Planar Minor
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.2307/2001217 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4251052060 / rank
 
Normal rank
Property / title
 
Well-Quasi-Ordering Infinite Graphs with Forbidden Finite Planar Minor (English)
Property / title: Well-Quasi-Ordering Infinite Graphs with Forbidden Finite Planar Minor (English) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3789551 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3773882 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Borel sets and Ramsey's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordering by Divisibility in Abstract Algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: The theory of well-quasi-ordering: a frequently discovered concept / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Fraissé's order type conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3890740 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic and Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Wohlquasigeordnete Klassen endlicher Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5734436 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5520569 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5537629 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial well‐ordering of sets of vectors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3222217 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. II. Algorithmic aspects of tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. IV: Tree-width and well-quasi-ordering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. V. Excluding a planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors and linkages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3801541 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nichtbeweisbarkeit von gewissen kombinatorischen Eigenschaften endlicher Bäume;Unprovability of certain combinatorial properties of finite trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A counter-example to ‘Wagner's conjecture’ for infinite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Menger-like property of tree-width: The finite case / rank
 
Normal rank

Latest revision as of 09:37, 20 June 2024

scientific article
Language Label Description Also known as
English
Well-Quasi-Ordering Infinite Graphs with Forbidden Finite Planar Minor
scientific article

    Statements

    0 references
    0 references
    1989
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    better-quasi-ordering
    0 references
    infinite graph
    0 references
    minor of a graph
    0 references
    well-quasi- ordering
    0 references
    0 references
    Well-Quasi-Ordering Infinite Graphs with Forbidden Finite Planar Minor (English)
    0 references