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