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