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