Structure Theorem and Isomorphism Test for Graphs with Excluded Topological Subgraphs (Q5252660): Difference between revisions

@@ Property / cites work @@
+Implicit branching and parameterized partial cover problems
+Normal rank
@@ Property / cites work @@
+Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees
+Normal rank
@@ Property / cites work @@
+Edge-disjoint paths in Planar graphs with constant congestion
+Normal rank
@@ Property / cites work @@
+Contraction decomposition in h-minor-free graphs and algorithmic applications
+Normal rank
@@ Property / cites work @@
+Q3579494
@@ Property / cites work: Q3579494 / rank @@
+Normal rank
@@ Property / cites work @@
+Descriptive Complexity, Canonisation, and Definable Graph Structure Theory
+Normal rank
@@ Property / cites work @@
+Local tree-width, excluded minors, and approximation algorithms
+Normal rank
@@ Property / cites work @@
+Fixed-point definability and polynomial time on graphs with excluded minors
+Normal rank
@@ Property / cites work @@
+Finding topological subgraphs is fixed-parameter tractable
+Normal rank
@@ Property / cites work @@
+A Simple Algorithm for the Graph Minor Decomposition − Logic meets Structural Graph Theory–
+Normal rank
@@ Property / cites work @@
+Q4633931
@@ Property / cites work: Q4633931 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating the list-chromatic number and the chromatic number in minor-closed and odd-minor-closed classes of graphs
+Normal rank
@@ Property / cites work @@
+Some recent progress and applications in graph minor theory
+Normal rank
@@ Property / cites work @@
+A shorter proof of the graph minor algorithm
@@ Property / cites work: A shorter proof of the graph minor algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+A simpler algorithm and shorter proof for the graph minor decomposition
+Normal rank
@@ Property / cites work @@
+Divide-and-Color
@@ Property / cites work: Divide-and-Color / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth
+Normal rank
@@ Property / cites work @@
+Isomorphism of graphs of bounded valence can be tested in polynomial time
+Normal rank
@@ Property / cites work @@
+Homomorphieeigenschaften und mittlere Kantendichte von Graphen
+Normal rank
@@ Property / cites work @@
+Parameterized graph separation problems
@@ Property / cites work: Parameterized graph separation problems / rank @@
+Normal rank
@@ Property / cites work @@
+Isomorphism of k-contractible graphs. A generalization of bounded valence and bounded genus
+Normal rank
@@ Property / cites work @@
+Q4352948
@@ Property / cites work: Q4352948 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4407447
@@ Property / cites work: Q4407447 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3684139
@@ Property / cites work: Q3684139 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. X: Obstructions to tree-decomposition
+Normal rank
@@ Property / cites work @@
+Graph minors. XIII: The disjoint paths problem
@@ Property / cites work: Graph minors. XIII: The disjoint paths problem / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. XVI: Excluding a non-planar graph
@@ Property / cites work: Graph minors. XVI: Excluding a non-planar graph / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. XX: Wagner's conjecture
@@ Property / cites work: Graph minors. XX: Wagner's conjecture / rank @@
+Normal rank