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