Minors in large almost-5-connected non-planar graphs (Q2911058): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Linear connectivity forces large complete bipartite minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Certain Homomorphism Properties of Graphs I. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a certain homomorphism properties of graphs II. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2702747 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(K_{6}\) minors in large 6-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of graphs with no cube minor / rank
 
Normal rank
Property / cites work
 
Property / cites work: An excluded minor theorem for the Octahedron plus an edge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Typical subgraphs of 3- and 4-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quickly excluding a planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. IX: Disjoint crossed paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4263662 / rank
 
Normal rank

Latest revision as of 16:54, 5 July 2024

scientific article
Language Label Description Also known as
English
Minors in large almost-5-connected non-planar graphs
scientific article

    Statements