Filtrer vos résultats
- 3
- 2
- 4
- 1
- 4
- 4
- 1
- 1
- 1
- 1
- 1
- 5
- 5
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
5 résultats
|
|
|
triés par
|
|
|
b-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs2013
Pré-publication, Document de travail
hal-00926924v1
|
||
|
|
Triangle‐free graphs that do not contain an induced subdivision of K 4 are 3‐colorableJournal of Graph Theory, 2018
Article dans une revue
hal-01993783v1
|
||
|
|
Asymptotic expansions for interior penalty solutions of control constrained linear-quadratic problemsMathematical Programming, Series A, 2012, 135 (1-2), pp.473-507
Article dans une revue
inria-00365540v1
|
||
|
|
b-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographsAlgorithmica, 2014, pp.17. ⟨10.1007/s00453-014-9921-5⟩
Article dans une revue
hal-01102516v1
|
||
|
|
The graph formulation of the union-closed sets conjectureEuropean Journal of Combinatorics, 2015, 43, pp.210-219. ⟨10.1016/j.ejc.2014.08.030⟩
Article dans une revue
hal-01253152v1
|