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