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