Linear connectivity forces large complete bipartite minors: an alternative approach (Q651041): 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: Q5315023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The excluded minor structure theorem with planarly embedded wall / 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. X: Obstructions to tree-decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XVII: Taming a vortex / rank
 
Normal rank

Latest revision as of 18:09, 4 July 2024

scientific article
Language Label Description Also known as
English
Linear connectivity forces large complete bipartite minors: an alternative approach
scientific article

    Statements

    Linear connectivity forces large complete bipartite minors: an alternative approach (English)
    0 references
    0 references
    0 references
    8 December 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    graph minor
    0 references
    tree-width
    0 references
    tree-decomposition
    0 references
    path-decomposition
    0 references
    complete bipartite minor
    0 references
    grid minor
    0 references
    vortex structure
    0 references
    near embedding
    0 references
    graphs on surfaces
    0 references
    Euler's formula
    0 references
    0 references