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