Pages that link to "Item:Q1079583"

The following pages link to Graph minors. V. Excluding a planar graph (Q1079583):

Displaying 50 items.

• Edge-disjoint odd cycles in 4-edge-connected graphs (Q273163) (← links)
• An edge variant of the Erdős-Pósa property (Q284717) (← links)
• Fast partitioning \(l\)-apex graphs with applications to approximating maximum induced-subgraph problems (Q287003) (← links)
• Reduction rules for the maximum parsimony distance on phylogenetic trees (Q306268) (← links)
• Coloring immersion-free graphs (Q326817) (← links)
• Rooted grid minors (Q345092) (← links)
• The parameterized complexity of local search for TSP, more refined (Q378245) (← links)
• The disjoint paths problem in quadratic time (Q412168) (← links)
• The Erdős-Pósa property for clique minors in highly connected graphs (Q412171) (← links)
• Linkless and flat embeddings in 3-space (Q420569) (← links)
• Local search: is brute-force avoidable? (Q439931) (← links)
• \textsc{max-cut} and containment relations in graphs (Q441861) (← links)
• The structure of graphs not admitting a fixed immersion (Q473098) (← links)
• A new graph construction of unbounded clique-width (Q509276) (← links)
• The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs (Q520046) (← links)
• Boundary properties of graphs for algorithmic graph problems (Q551178) (← links)
• Algorithmic uses of the Feferman-Vaught theorem (Q598280) (← links)
• The edge-density for \(K_{2,t}\) minors (Q618032) (← links)
• Linear connectivity forces large complete bipartite minors: an alternative approach (Q651041) (← links)
• Implicit branching and parameterized partial cover problems (Q657922) (← links)
• Minimal classes of graphs of unbounded clique-width (Q659655) (← links)
• Polynomial treewidth forces a large grid-like-minor (Q661945) (← links)
• Algebraically grid-like graphs have large tree-width (Q668066) (← links)
• \(K_{6}\) minors in large 6-connected graphs (Q684126) (← links)
• A new proof of the flat wall theorem (Q684127) (← links)
• What is on his mind? (Q709300) (← links)
• Upper domination: towards a dichotomy through boundary properties (Q722525) (← links)
• Excluding a large theta graph (Q723880) (← links)
• Graphs without large apples and the maximum weight independent set problem (Q742580) (← links)
• Graphs without two vertex-disjoint \(S\)-cycles (Q785795) (← links)
• Graph minors. III. Planar tree-width (Q799684) (← links)
• The structure of the models of decidable monadic theories of graphs (Q810005) (← links)
• The edge-Erdős-Pósa property (Q822640) (← links)
• Obstructions for partitioning into forests and outerplanar graphs (Q831856) (← links)
• Contraction bidimensionality of geometric intersection graphs (Q832527) (← links)
• Parameterized dominating set problem in chordal graphs: Complexity and lower bound (Q839675) (← links)
• Vertex-minors, monadic second-order logic, and a conjecture by Seese (Q858683) (← links)
• The Erdős-Pósa property for vertex- and edge-disjoint odd cycles in graphs on orientable surfaces (Q868342) (← links)
• Some recent progress and applications in graph minor theory (Q878052) (← links)
• Immersion in four-edge-connected graphs (Q895999) (← links)
• Bipartite minors (Q896000) (← links)
• The challenges of unbounded treewidth in parameterised subgraph counting problems (Q897601) (← links)
• Thue type problems for graphs, points, and numbers (Q941381) (← links)
• Nonrepetitive colorings of graphs of bounded tree-width (Q941387) (← links)
• Linearity of grid minors in treewidth with applications through bidimensionality (Q949776) (← links)
• Tree-width of graphs without a \(3\times 3\) grid minor (Q967302) (← links)
• Recent developments on graphs of bounded clique-width (Q967317) (← links)
• Crossing-critical graphs with large maximum degree (Q974468) (← links)
• Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction (Q1022348) (← links)
• Linear connectivity forces large complete bipartite minors (Q1026000) (← links)