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