I. Objectif, 91 3.3.2 Propriétés sur l'ensemble ?, Seconde étape de réduction . . . . . . . . . . . . . . . . . . . 103

.. Complexité-dans-le-cas-d-'ensembles-quelconques, 107 3.4.1 Paramétré par la largeur arborescente (tree-width) 107 3.4.2 Paramétré par la largeur arborescente (tree-width) et la taille de la solution

S. Arora and B. Barak, Computational complexity: a modern approach, 2009.
DOI : 10.1017/CBO9780511804090

[. Arnborg, D. G. Corneil, and A. Proskurowski, -Tree, SIAM Journal on Algebraic Discrete Methods, vol.8, issue.2, pp.277-284, 1987.
DOI : 10.1137/0608024

S. Noga-alon and . Gutner, Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs, Algorithmica, vol.10, issue.2, pp.544-556, 2009.
DOI : 10.1007/s00453-008-9204-0

[. Appel and W. Haken, Every planar map is four colorable, Bulletin of the American Mathematical Society, vol.82, issue.5, pp.711-712, 1976.
DOI : 10.1090/S0002-9904-1976-14122-5

S. Adamsky and T. S. Maibaum, Handbook of logic in computer science: background: mathematical structures, 1992.

O. Amini, F. Mazoit, N. Nisse, and S. Thomassé, Submodular partition functions, Discrete Mathematics, vol.309, issue.20, pp.6000-6008, 2009.
DOI : 10.1016/j.disc.2009.04.033
URL : https://hal.archives-ouvertes.fr/lirmm-00432698

Y. Bu, D. Chen, A. Raspaud, and W. Wang, Injective coloring of planar graphs, Discrete Applied Mathematics, vol.157, issue.4, pp.663-672, 2009.
DOI : 10.1016/j.dam.2008.08.016
URL : https://hal.archives-ouvertes.fr/hal-00411739

P. Bellenbaum and R. Diestel, Two short proofs concerning treedecompositions, Combinatoric, Probability, and Computing, pp.1-7, 2002.

A. Felix and . Behrend, On sets of integers which contain no three terms in arithmetical progression, Proceedings of the National Academy Science, pp.331-332, 1946.

P. Bff-+-10-]-lali-barrière, F. V. Flocchini, P. Fomin, N. Fraigniaud, N. Nisse et al., Connected graph searching, 2010.

L. Hans, A. Bodlaender, A. M. Grigoriev, and . Koster, Treewidth lower bounds with brambles, Algorithmica, vol.51, issue.1, pp.81-98, 2008.

A. Björklund, T. Husfledt, P. Kaski, and M. Koivisto, Fourier meets Möbius: fast subset convolution, STOC'07, Proceedings of the 39th Annual ACM Symposium on the Theory of Computing, pp.67-74, 2007.

[. Bruyère, G. Hansel, C. Michaux, and R. Villemaire, Logic and p-recognizable sets of integers, Bulletin of the Belgian Mathematical Society, vol.1, issue.2, pp.191-238, 1994.

L. Hans and . Bodlaender, A linear-time algorithm for finding tree-decompositions of small treewidth, SIAM Journal on Computing, vol.25, pp.1305-1317, 1996.

J. Bourgain, On triples in arithmetic progression Geometric and Functional Analysis, pp.968-984, 1999.

J. Bourgain, Roth???s theorem on progressions revisited, Journal d'Analyse Math??matique, vol.104, issue.1, pp.155-192, 2008.
DOI : 10.1007/s11854-008-0020-x

V. Bouchitté and I. Todinca, Treewidth and Minimum Fill-in: Grouping the Minimal Separators, SIAM Journal on Computing, vol.31, issue.1, pp.212-232, 2001.
DOI : 10.1137/S0097539799359683

V. Bouchitté and I. Todinca, Listing all potential maximal cliques of a graph, Theoretical Computer Science, vol.276, issue.1-2, pp.17-32, 2002.
DOI : 10.1016/S0304-3975(01)00007-X

[. Bui-xuan, J. A. Telle, and M. Vatshelle, Boolean-Width of Graphs, IWPEC'09, Proceedings of the 4th International Workshop on Parameterized and Exact Computation, pp.61-74, 2009.
DOI : 10.1007/978-3-642-11269-0_5
URL : https://hal.archives-ouvertes.fr/hal-00555494

[. Bui-xuan-arne-telle and M. Vatshelle, Boolean-width of graphs, Theoretical Computer Science, vol.412, issue.39, pp.5187-5204, 2011.
DOI : 10.1016/j.tcs.2011.05.022

[. Courcelle and J. Engelfriet, Graph structure and monadic second-order logic, a language theoretic approach, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00646514

M. Chapelle, Domination généralisée sur quelques classes de graphes, 2008.

M. Chen, G. Hahn, A. Raspaud, and W. Wang, Some results on the injective chromatic number of??graphs, Journal of Combinatorial Optimization, vol.269, issue.3, 2011.
DOI : 10.1007/s10878-011-9386-2

J. Gerard, D. Chang, and . Kuo, The L(2, 1) labeling problem on graphs, SIAM Journal on Discrete Mathematics, vol.9, issue.2, pp.309-316, 1996.

J. Gerard, W. Chang, D. Ke, D. D. Kuo, R. K. Liu et al., On L(d, 1)-labelings of graphs, Discrete Mathematics, vol.220, pp.57-66, 2000.

D. W. Cranston, S. Kim, and G. Yu, Injective colorings of sparse graphs, Discrete Mathematics, vol.310, issue.21, pp.3102965-2973, 2010.
DOI : 10.1016/j.disc.2010.07.003

B. Courcelle, J. A. Makowsky, and U. Rotics, On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic, Discrete Applied Mathematics, vol.108, issue.1-2, pp.23-52, 2001.
DOI : 10.1016/S0166-218X(00)00221-3

F. Mathieu-chapelle, I. Mazoit, and . Todinca, Constructing Brambles, Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science, pp.223-234, 2009.
DOI : 10.1006/jctb.1993.1027

I. Nelson, Error-correcting codes on the tower of Hanoi graphs, Discrete Mathematics, vol.208209, pp.157-175, 1999.

J. Marek-cygan, M. Nederlof, M. Pilipczuk, J. M. Pilipczuk, J. Van-rooij et al., Solving connectivity problems parameterized by treewidth in single exponential time, FOCS'11, Proceedings of the 52nd Annual IEEE Symposium on Foundations of Computer Science, 2011.

A. Stephen and . Cook, The complexity of theorem-proving procedures, STOC'71, Proceedings of the 3rd Annual ACM Symposium on Theory of Computing, 1971.

B. Courcelle, The expression of graph properties and graph transformations in monadic second-order logic. In Handbook of Graph Grammars and Computing by Graph Transformation, pp.313-400, 1997.

G. Rodney, M. R. Downey, and . Fellows, Fixed-parameter tractability and completeness . I. basic results, SIAM Journal on Computing, vol.24, issue.4, pp.873-921, 1995.

G. Rodney, M. R. Downey, and . Fellows, Fixed-parameter tractability and completeness . II. on completeness for W[1], Theoretical Computer Science, vol.141, pp.109-131, 1995.

G. Rodney, M. R. Downey, and . Fellows, Parameterized complexity, 1999.

A. Doyon, G. Hahn, and A. Raspaud, Some bounds on the injective chromatic number of graphs, Discrete Mathematics, vol.310, issue.3, pp.585-590, 2010.
DOI : 10.1016/j.disc.2009.04.020
URL : https://hal.archives-ouvertes.fr/hal-00411723

R. Diestel, Graph theory, 2010.

W. Edsger and . Dijkstra, A note on two problems in connexion with graphs, Numerische Mathematik, vol.1, issue.1, pp.269-271, 1959.

R. Diestel, T. R. Jensen, K. Y. Gorbunov, and C. Thomassen, Highly Connected Sets and the Excluded Grid Theorem, Journal of Combinatorial Theory, Series B, vol.75, issue.1, pp.61-73, 1999.
DOI : 10.1006/jctb.1998.1862

M. Dom, D. Lokshtanov, S. Saurabh, and Y. Villanger, Capacitated Domination and Covering: A Parameterized Perspective, IWPEC'08, Proceedings of the 3rd International Workshop on Parameterized and Exact Computation, pp.78-90, 2008.
DOI : 10.1007/978-3-540-79723-4_9

M. Elkin, An improved construction of progression-free sets, SODA'10 Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms, pp.886-905, 2010.

P. Erd?, O. , and P. Turán, On some sequences of integers, Journal of the London Mathematical Society, vol.11, pp.261-264, 1936.

M. Fellows, F. V. Fomin, D. Lokshtanov, F. Rosamond, S. Saurabh et al., On the Complexity of Some Colorful Problems Parameterized by Treewidth, COCOA'07, Proceedings of the 1st International Conference on Combinatorial Optimization and Applications, pp.366-377, 2007.
DOI : 10.1007/978-3-540-73556-4_38

J. Flum and M. Grohe, Describing parameterized complexity classes. Information and Computation, pp.291-319, 2003.

J. Flum and M. Grohe, Parameterized complexity theory, 2006.

J. Fiala, P. A. Golovach, and J. Kratochvíl, Distance Constrained Labelings of Graphs of Bounded Treewidth, ICALP'05 Proceedings of the 32nd International Colloquium on Automata, Languages and Programming, pp.3650-372, 2005.
DOI : 10.1007/11523468_30

M. Feige, J. R. Hajiaghayi, and . Lee, Improved approximation algorithms for minimum weight vertex separators, ACM Journal on Computing, vol.38, issue.2, pp.629-657, 2008.

U. Feige and J. Kilian, Zero Knowledge and the Chromatic Number, Journal of Computer and System Sciences, vol.57, issue.2, pp.187-199, 1998.
DOI : 10.1006/jcss.1998.1587

V. Fedor, D. Fomin, and . Kratsch, Exponential time algorithms, 2010.

V. Fedor, D. Fomin, I. Kratsch, Y. Todinca, and . Villanger, Exact algorithms for treewidth and minimum fill-in, SIAM Journal on Computing, vol.38, issue.3, pp.1058-1079, 2008.

V. Fedor, F. Fomin, I. Mazoit, and . Todinca, Computing branchwidth via efficient triangulations and blocks, WG'05 Proceedings of the 31st International Workshop on Graph-Theoretic Concepts in Computer Science, pp.374-384, 2005.

W. Gasarch, J. Glenn, and C. P. Kruskal, Finding large 3-free sets I: The small n case, Journal of Computer and System Sciences, vol.74, issue.4, pp.628-655, 2008.
DOI : 10.1016/j.jcss.2007.06.002

J. Geelen, B. Gerards, N. Robertson, and G. Whittle, Obstructions to branch-decomposition of matroids, Journal of Combinatorial Theory, Series B, vol.96, issue.4, pp.560-570, 2006.
DOI : 10.1016/j.jctb.2005.11.001

J. Geelen, B. Gerards, and G. Whittle, Tangles, tree-decompositions and grids in matroids, Journal of Combinatorial Theory, Series B, vol.99, issue.4, pp.657-667, 2009.
DOI : 10.1016/j.jctb.2007.10.008

R. Michael, D. S. Garey, and . Johnson, Computers and intractability. A guide to the theory of NP-completeness, 1979.

A. Gupta, D. Kaller, and T. Shermer, On the Complements of Partial k-Trees, ICALP'99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming, pp.382-391, 1999.
DOI : 10.1007/3-540-48523-6_35

A. G. Petr, O. Kratochvíl, and . Suchý, Parameterized complexity of generalized domination problems, WG'09, Proceedings of the 35th International Workshop on Graph-Theoretic Concepts in Computer Science, pp.133-142, 2010.

M. Grohe and D. Marx, On tree width, bramble size, and expansion, Journal of Combinatorial Theory, Series B, vol.99, issue.1, pp.218-228, 2009.
DOI : 10.1016/j.jctb.2008.06.004

A. Petr, Y. Golovach, and . Villanger, Parameterized complexity for domination problems on degenerate graphs, WG'08 Proceedings of the 34th International Workshop on Graph-Theoretic Concepts in Computer Science, pp.195-205, 2008.

[. Green and J. Wolf, A Note on Elkin???s Improvement of Behrend???s Construction, Additive Number Theory: Festschrift in Honor of the Sixtieth Birthday of Melvyn B. Nathanson, pp.141-144, 2010.
DOI : 10.1007/978-0-387-68361-4_9

J. R. Griggs and R. K. Yeh, Labelling Graphs with a Condition at Distance 2, SIAM Journal on Discrete Mathematics, vol.5, issue.4, pp.586-595, 1992.
DOI : 10.1137/0405048

R. Halin, S-functions for graphs, Journal of Geometry, vol.147, issue.1-2, pp.171-186, 1976.
DOI : 10.1007/BF01917434

V. Juris and . Hartmanis, Gödel, von Neumann and the p =?np problem. Current Trends in Theoretical Computer Science: Essays and Tutorials, pp.445-450, 1989.

D. Heath-brown, Integer Sets Containing No Arithmetic Progressions, Journal of the London Mathematical Society, vol.2, issue.3, pp.385-394, 1987.
DOI : 10.1112/jlms/s2-35.3.385

V. Illya and . Hicks, Graphs, branchwidth, and tangles! oh my! Networks, pp.55-60, 2004.

G. Hahn, J. Kratochvíl, J. ?irá?, and D. Sotteau, On the injective chromatic number of graphs, Discrete Mathematics, vol.256, issue.1-2, pp.179-192, 2002.
DOI : 10.1016/S0012-365X(01)00466-6

J. E. Hopcroft, R. Motwani, and J. D. Ullman, Introduction to automata theory, languages, and computation, 2001.

I. Holyer, The NP-Completeness of Edge-Coloring, SIAM Journal on Computing, vol.10, issue.4, pp.718-720, 1981.
DOI : 10.1137/0210055

A. Hell, J. Raspaud, and . Stacho, On Injective Colourings of Chordal Graphs, Proceedings of the 8th Latin American Symposium on Theoretical Informatics, pp.520-530, 2008.
DOI : 10.1007/978-3-540-78773-0_45

J. Varlejs, H. , and R. E. Stearns, On the computational complexity of algorithms. Transactions of the, pp.285-306, 1965.

C. Fred, R. E. Hennie, and . Stearns, Two-tape simulation of multitape turing machines, Journal of the ACM, vol.13, issue.4, pp.533-546, 1966.

R. M. Karp, Reducibility among combinatorial problems, Complexity of Computer Computations, pp.85-103, 1972.

[. Khanna, N. Linial, and S. Safra, On the Hardness of Approximating the Chromatic Number, Combinatorica, vol.20, issue.3, pp.393-415, 2000.
DOI : 10.1007/s004930070013

J. Kratochvíl, P. D. Manuel, and M. Miller, Generalized domination in chordal graphs, Nordic Journal on Computing, vol.2, pp.41-50, 1995.

E. Donald and . Knuth, Big Omicron and big Omega and big Theta, ACM SIGACT News, vol.8, issue.2, pp.18-24, 1976.

S. Kreutzer and S. Tazari, On brambles, grid-like minors, and parametrized intractability of monadic second-order logic, SODA'10, Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, 2010.

J. Lagergren, Upper Bounds on the Size of Obstructions and Intertwines, Journal of Combinatorial Theory, Series B, vol.73, issue.1, pp.7-40, 1998.
DOI : 10.1006/jctb.1997.1788

L. Levin, Universal search problems. Problems of Information Transmission, pp.265-266, 1973.

D. Leven and Z. Galil, NP completeness of finding the chromatic index of regular graphs, Journal of Algorithms, vol.4, issue.1, pp.35-44, 1983.
DOI : 10.1016/0196-6774(83)90032-9

[. Lokshtanov, D. Marx, and S. Saurabh, Known Algorithms on Graphs of Bounded Treewidth are Probably Optimal, SODA'11, Proceedings of the ACM- SIAM Symposium On Discrete Algorithms, pp.777-789, 2011.
DOI : 10.1137/1.9781611973082.61

L. Lyaudet, F. Mazoit, and S. Thomassé, Partitions versus sets: A case of duality, European Journal of Combinatorics, vol.31, issue.3, pp.681-687, 2010.
DOI : 10.1016/j.ejc.2009.09.004
URL : https://hal.archives-ouvertes.fr/hal-00345894

D. Lokshtanov, New methods in parametrized algorithms and complexity, 2009.

B. Lucena, Achievable sets, brambles, and sparse treewidth obstructions, Discrete Applied Mathematics, vol.155, issue.8, pp.1055-1065, 2007.
DOI : 10.1016/j.dam.2006.11.006

[. Lu?ar, R. ?krekvoski, and M. Tancer, Injective colorings of planar graphs with few colors, Discrete Mathematics, vol.309, issue.18, pp.5636-5649, 2009.
DOI : 10.1016/j.disc.2008.04.005

C. Lund and M. Yannakakis, On the hardness of approximating minimization problems, Journal of the ACM, vol.41, issue.5, pp.960-981, 1994.
DOI : 10.1145/185675.306789

A. B. Matos, Periodic sets of integers, Theoretical Computer Science, vol.127, issue.2, pp.287-312, 1994.
DOI : 10.1016/0304-3975(94)90044-2

F. Mazoit, Décompositions algorithmiques des graphes, 2004.

M. Matamala and J. Zamora-ponce, Additive coloring. manuscript, 2010.

R. Niedermeier, Invitation to fixed-parameter algorithms, 2006.
DOI : 10.1093/acprof:oso/9780198566076.001.0001

P. Odifreddi, Classical recursion theory. The theory of functions and sets of natural numbers, volume 125 of Studies in logic, and foundations of mathematics, 1989.

[. Oum and P. D. Seymour, Approximating clique-width and branch-width, Journal of Combinatorial Theory, Series B, vol.96, issue.4, pp.514-528, 2006.
DOI : 10.1016/j.jctb.2005.10.006

C. H. Papadimitriou, Computational complexity, 1994.

C. Paul and J. A. Telle, New Tools and Simpler Algorithms for Branchwidth, ESA 2005, 13th Annual European Symposium, pp.379-390, 2005.
DOI : 10.1007/11561071_35
URL : https://hal.archives-ouvertes.fr/lirmm-00106466

M. P?atrascup?atrascu and R. Williams, On the possibility of faster sat algorithms, SO- DA'10 Proceedings of the 21th Annual ACM-SIAM Symposium on Discrete Algorithms, pp.1065-1075, 2010.

S. Ramachandramurthi, The Structure and Number of Obstructions to Treewidth, SIAM Journal on Discrete Mathematics, vol.10, issue.1, pp.146-157, 1997.
DOI : 10.1137/S0895480195280010

B. Reed, Tree Width and Tangles: A New Connectivity Measure and Some Applications, Surveys in Combinatorics, 1997.
DOI : 10.1017/CBO9780511662119.006

K. F. Roth, Sur quelques ensembles d'entiers, C.R. Académie des Sciences de Paris, vol.234, pp.388-390, 1952.

K. F. Roth, On certain sets of integers, Journal of the London Mathematical Society, vol.28, pp.104-109, 1953.

K. F. Roth, On Certain Sets of Integers (II), Journal of the London Mathematical Society, vol.1, issue.1, pp.20-26, 1954.
DOI : 10.1112/jlms/s1-29.1.20

N. Robertson and P. D. Seymour, Graph minors. I. Excluding a forest, Journal of Combinatorial Theory, Series B, vol.35, issue.1, pp.39-61, 1983.
DOI : 10.1016/0095-8956(83)90079-5

N. Robertson and P. D. Seymour, Graph minors. III. Planar tree-width, Journal of Combinatorial Theory, Series B, vol.36, issue.1, pp.49-64, 1984.
DOI : 10.1016/0095-8956(84)90013-3

N. Robertson and P. D. Seymour, Graph minors. II. Algorithmic aspects of tree-width, Journal of Algorithms, vol.7, issue.3, pp.309-322, 1986.
DOI : 10.1016/0196-6774(86)90023-4

N. Robertson and P. D. Seymour, Graph minors. V. Excluding a planar graph, Journal of Combinatorial Theory, Series B, vol.41, issue.1, pp.92-114, 1986.
DOI : 10.1016/0095-8956(86)90030-4
URL : http://doi.org/10.1006/jctb.1999.1919

N. Robertson and P. D. Seymour, Graph minors. X. Obstructions to tree-decomposition, Journal of Combinatorial Theory, Series B, vol.52, issue.2, pp.153-190, 1991.
DOI : 10.1016/0095-8956(91)90061-N
URL : http://doi.org/10.1006/jctb.1999.1919

N. Robertson and P. D. Seymour, Graph Minors. XX. Wagner's conjecture, Journal of Combinatorial Theory, Series B, vol.92, issue.2, pp.325-357, 2004.
DOI : 10.1016/j.jctb.2004.08.001

[. Raman, S. Saurabh, and S. Srihari, Parameterized Algorithms for Generalized Domination, COCOA'08, Proceedings of the 2nd International Conference on Combinatorial Optimization and Applications, pp.116-126, 2008.
DOI : 10.1007/978-3-540-85097-7_11
URL : http://espace.library.uq.edu.au/view/UQ:279221/MIC15UQ279221.pdf

N. Robertson, T. Sanders, P. D. Seymour, and R. Thomas, The Four-Colour Theorem, Journal of Combinatorial Theory, Series B, vol.70, issue.1, pp.2-44, 1997.
DOI : 10.1006/jctb.1997.1750

[. Robertson, P. D. Seymour, and R. Thomas, Quickly Excluding a Planar Graph, Journal of Combinatorial Theory, Series B, vol.62, issue.2, pp.323-348, 1994.
DOI : 10.1006/jctb.1994.1073

A. Bruce, D. R. Reed, and . Wood, Polynomial treewidth forces a large grid-likeminor, 2008.

T. Sanders, On certain other sets of integers, Journal d'Analyse Math??matique, vol.56, issue.12, 2011.
DOI : 10.1007/s11854-012-0003-9

T. Sanders, On Roth's theorem on progressions, Annals of Mathematics, vol.174, issue.1, pp.619-636, 2011.
DOI : 10.4007/annals.2011.174.1.20

J. E. Savage, Models of computation: exploring the power of computing, 1998.

M. Sipser, Introduction to the theory of computation. Thomson Course Technology, 2006.

D. [. Salem and . Spencer, On Sets of Integers Which Contain No Three Terms in Arithmetical Progression, Proceedings of the National Academy Science, pp.561-563, 1942.
DOI : 10.1073/pnas.28.12.561

D. Paul, R. Seymour, and . Thomas, Graph searching, and a min-max theorem for tree-width, Journal of Combinatorial Theory Series B, vol.58, pp.22-33, 1993.

D. Paul, R. Seymour, and . Thomas, Call routing and the ratcatcher, Combinatorica, vol.14, issue.2, pp.217-241, 1994.

E. Szemerédi, Integer sets containing no arithmetic progressions, Acta Mathematica Hungarica, vol.28, issue.1-2, pp.155-158, 1990.
DOI : 10.1007/BF01903717

J. A. , T. , and A. Proskurowski, Algorithms for vertex partitioning problems on partial k-trees, SIAM Journal on Discrete Mathematics, vol.10, issue.4, pp.529-550, 1997.

A. Boris and . Trakhtenbrot, A survey of Russian approaches to perebor (brute-force searches) algorithms, Annals of the History of Computing, vol.6, issue.4, pp.384-400, 1984.

G. Vadim and . Vizing, The chromatic class of a multigraph, Cybernetics, vol.1, pp.32-41, 1965.

M. M. Johan, H. L. Van-rooij, P. Bodlaender, and . Rossmanith, Dynamic programming on tree decompositions using generalised fast subset convolution, ESA'09, Proceedings of the 17th Annual European Symposium on Algorithms, pp.566-577, 2009.

R. Williams, Improving exhaustive search implies superpolynomial lower bounds, STOC'10 Proceedings of the 42nd Annual ACM Symposium on Theory of Computing, pp.231-240, 2010.
DOI : 10.1145/1806689.1806723
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.156.2340

G. J. Woeginger, Exact Algorithms for NP-Hard Problems: A Survey, Lecture Notes in Computer Science, vol.2570, pp.185-207, 2003.
DOI : 10.1007/3-540-36478-1_17

D. Zuckerman, Linear degree extractors and the inapproximability of max clique and chromatic number, Proceedings of the thirty-eighth annual ACM symposium on Theory of computing , STOC '06, 2006.
DOI : 10.1145/1132516.1132612

C. Mathieu and . Décompositions-de-graphes, quelques limites et obstructions Résumé : Les décompositions de graphes, lorsqu'elles sont de petite largeur, sont souvent utilisées pour résoudre plus efficacement des problèmes étant difficiles dans le cas de graphes quelconques, ce travail de thèse, nous nous intéressons aux limites liées à ces décompositions

. Dans-une-première-partie, nous donnons un algorithme généralisant et unifiant la construction d'obstructions pour différentes largeurs de graphes, en temps XP lorsque paramétré par la largeur considérée. Nous obtenons en particulier le premier algorithme permettant de construire efficacement une obstruction à la largeur arborescente en temps O(n tw+4

. Dans-la-dernière-partie, nous étudions la complexité d'un nouveau problème de coloration appelé k-COLORATION ADDITIVE, combinant théorie des graphes et théorie des nombres. Nous montrons que ce nouveau problème est NP-complet pour tout k ? 4 fixé

. First, we give a generic algorithm unifying obstructions' construction for several graph widths, in XP time when parameterized by the considered width. In particular, it gives the first algorithm computing efficiently an obstruction to tree-width in time O

. Finally, we study the computational complexity of a new coloration problem, named k- ADDITIVE COLORING, which combines both graph theory and number theory. We show that this new problem is NP-complete for any fixed number k ? 4, while it can be solved in polynomial time on trees for any k