Exponential Time Hypothesis Algorithm Topological minors Cutwidth Graph algorithms Directed graphs Reconfiguration Planar graph Graph minors Chromatic number Digraphs Discharging method Graph drawing Combinatoire Protrusion decomposition Combinatorics Basis Oriented matroid Hyperplane arrangement Induced subgraphs Flat Wall Theorem Duality Maximum average degree Graph Minors Dual parameterization Discrete Mathematics Sparse graphs Coloration Graph modification problems NP-completeness Phylogenetic networks Pathwidth Directed disjoint paths Analysis of algorithms 2-partition FPT-algorithm Hitting minors Approximation algorithms Graphs Clique-width Fixed-parameter tractability Combinatorics on words Activity Treewidth Obstructions First-order logic Tournaments FPT algorithm Robust optimization Domination Branchwidth 2-distance coloring Coloring Graph Bijection Planar graphs Irrelevant vertex technique Parameterized complexity Approximation algorithm Algorithms Optical networks Immersions Complexity dichotomy Graph coloring Digraph Kernelization Parameterized algorithms Bidimensionality Polynomial kernel Edge contractions Pattern avoidance Clique tree Dynamic programming Erdős–Pósa property Graph decompositions Linkages Chordal graphs Computational complexity Vertex cover Single-exponential algorithm Edge coloring Graph theory Matroid Complexity Tutte polynomial Phylogenetics Bipartite graph Minimal triangulation Graph decomposition Complexité paramétrée Graph colouring Well-quasi-ordering Homomorphism Bramble Linear kernels Directed tree-width Discharging procedure Edge contraction Interval graphs Girth