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