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