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