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