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