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