Skip to Main content Skip to Navigation



 Algorithmes, Graphes et Combinatoire

Consult your copyright


Consulter la politique des éditeurs également sur

Number of Files


Nomber of Notices


Collaborations’ map


NP-completeness Clique-width Edge coloring Tournaments Oriented coloring Erdős–Pósa property Maximum average degree Clique tree Parameterized algorithms 2-distance coloring Cutwidth MCS Duality Discharging procedure Matroid Sparse graphs Avoidability Domination Clause implication Graph theory Hardness of approximation Graph decomposition Clique separator decomposition Non-crossing partitions Oriented graph Graph minors Circuit design Dynamic programming Bijection Oriented matroid Algorithms Combinatoire Minimal triangulation Graphs on surfaces Graph colouring Basis Minimum degree Acyclic coloring Breadth First Search Activity Combinatorics Homomorphism Girth Algorithm Polynomial kernel Immersions Approximation GRAPHS Kernelization FPT algorithm Approximation algorithms Pattern avoidance Protrusion decomposition Planar graph Coloring Chordal graph Packings in graphs Analyse prédicative Fixed-parameter tractability Linear kernels Combinatorics on words Parameterized complexity Linkages Obstructions Well-quasi-ordering Square coloring Branchwidth Optical networks Chordal graphs Hyperplane arrangement Bidimensionality LexBFS 2-partition ALGORITHME Interval graphs Tutte polynomial Phylogenetic networks Permutation graphs Computational complexity Approximation algorithm Carving-width Graph coloring Butterfly Graphs Analysis of algorithms Tournament Memory optimization Topological minors Complexité paramétrée Boolean mapping Planar graphs Complexity Graph Minors Graph algorithms Treewidth Graph Branch-width Traffic grooming Algorithmique des graphes Coloration