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