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