Minor-equivalence for infinite graphs (Q1296983): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Über unendliche Wege in Graphen / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A counterexample to Seymour's self‐minor conjecture / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4273862 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Excluding infinite clique minors / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Quickly excluding a planar graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3216652 / rank | |||
Normal rank |
Revision as of 21:30, 28 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Minor-equivalence for infinite graphs |
scientific article |
Statements
Minor-equivalence for infinite graphs (English)
0 references
3 August 1999
0 references
characterizations
0 references
minor equivalence
0 references