Skip to Main content Skip to Navigation



 Algorithmes, Graphes et Combinatoire

Consult your copyright

Number of Files


Nomber of Notices


Collaborations’ map


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