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