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