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