Polynomial treewidth forces a large grid-like-minor (Q661945): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 0809.0724 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The linear arboricity of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4792909 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3424767 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On complete subgraphs of \(r\)-chromatic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linearity of grid minors in treewidth with applications through bidimensionality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quickly deciding minor-closed parameters in general graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4947393 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Highly connected sets and the excluded grid theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4074927 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Odd Independent Transversals are Odd / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hitting all maximum cliques with a stable set using lopsided independent transversals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bound of the Hadwiger number of graphs by their average degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent transversals in locally sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homomorphieeigenschaften und mittlere Kantendichte von Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4352948 / 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: Quickly excluding a planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph searching and a min-max theorem for tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal problems for transversals in graphs with bounded degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: The extremal function for complete minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extremal function for contractions of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique minors in Cartesian products of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent Transversals and Independent Coverings in Sparse Partite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent transversals in \(r\)-partite graphs / rank
 
Normal rank

Latest revision as of 22:30, 4 July 2024

scientific article
Language Label Description Also known as
English
Polynomial treewidth forces a large grid-like-minor
scientific article

    Statements

    Polynomial treewidth forces a large grid-like-minor (English)
    0 references
    0 references
    0 references
    11 February 2012
    0 references
    0 references
    large grid minor
    0 references
    large grid-like minor
    0 references
    polynomial treewidth
    0 references
    0 references
    0 references