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