Filtrer vos résultats
- 70
- 18
- 60
- 19
- 5
- 1
- 1
- 1
- 1
- 1
- 82
- 51
- 2
- 8
- 6
- 7
- 6
- 6
- 5
- 8
- 5
- 2
- 4
- 7
- 2
- 1
- 5
- 7
- 2
- 2
- 2
- 1
- 88
- 81
- 22
- 7
- 7
- 4
- 4
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 88
- 7
- 7
- 7
- 7
- 7
- 6
- 5
- 5
- 5
- 5
- 4
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
88 résultats
Linear choosability of graphsDiscrete Mathematics, 2008, 308 (17), pp.3938-3950
Article dans une revue
hal-00306479v1
|
|||
|
Dynamic list coloring of bipartite graphsDiscrete Applied Mathematics, 2010, 158 (17), pp.1963-1965. ⟨10.1016/j.dam.2010.08.007⟩
Article dans une revue
inria-00528134v1
|
||
|
Coloring planar graphs with three colors and no large monochromatic componentsCombinatorics, Probability and Computing, 2014, 23 (4), pp.551-570. ⟨10.1017/S0963548314000170⟩
Article dans une revue
hal-01020703v1
|
||
List-Coloring Claw-Free Graphs with Small Clique NumberGraphs and Combinatorics, 2014, 30 (2), pp.365-375. ⟨10.1007/s00373-012-1272-x⟩
Article dans une revue
hal-00949817v1
|
|||
|
A unified approach to distance-two colouring of graphs on surfacesCombinatorica, 2013, 33 (3), pp.253-296. ⟨10.1007/s00493-013-2573-2⟩
Article dans une revue
hal-00924016v1
|
||
|
Bipartite complements of circle graphsDiscrete Mathematics, 2020, 343 (6), pp.111834. ⟨10.1016/j.disc.2020.111834⟩
Article dans une revue
hal-02321500v1
|
||
|
Local approximation of the Maximum Cut in regular graphsTheoretical Computer Science, 2020, 820, pp.45-59. ⟨10.1016/j.tcs.2020.03.008⟩
Article dans une revue
hal-02816216v1
|
||
|
Coloring non-crossing stringsThe Electronic Journal of Combinatorics, 2016, 23 (4), pp.4.4. ⟨10.37236/5710⟩
Article dans une revue
hal-01480244v1
|
||
|
Asymptotic Dimension of Minor-Closed Families and Assouad-Nagata Dimension of SurfacesJournal of the European Mathematical Society, 2023, ⟨10.4171/JEMS/1341⟩
Article dans une revue
hal-03042934v1
|
||
|
Boxicity of graphs on surfacesGraphs and Combinatorics, 2013, 29 (3), pp.417-427. ⟨10.1007/s00373-012-1130-x⟩
Article dans une revue
hal-00843774v1
|
||
|
anytime tree searches for operations researchJournées G-SCOP 2019, May 2019, Grenoble, France
Poster de conférence
hal-02155357v1
|
||
|
Graph colorings, flows and perfect matchingsCombinatorics [math.CO]. Université Grenoble Alpes, 2017
HDR
tel-01850463v1
|
||
|
Box representations of embedded graphsDiscrete and Computational Geometry, 2017, 57 (3), pp.590-606. ⟨10.1007/s00454-016-9837-8⟩
Article dans une revue
hal-01240350v1
|
||
|
Separation Choosability and Dense Bipartite Induced SubgraphsCombinatorics, Probability and Computing, 2019, 28 (5), pp.720-732. ⟨10.1017/S0963548319000026⟩
Article dans une revue
hal-02275202v1
|
||
|
Isometric universal graphsSIAM Journal on Discrete Mathematics, 2021, 35 (2), pp.1224-1237. ⟨10.1137/21M1406155⟩
Article dans une revue
hal-03172653v1
|
||
Acyclic improper choosability of graphsCS06 - Sixth Czech-Slovak International Symposium on Combinatorics, Graph Theory, Algorithms and Applications, Jul 2006, Slovakia. pp.251--258
Communication dans un congrès
hal-00307157v1
|
|||
|
Boxicity, poset dimension, and excluded minorsThe Electronic Journal of Combinatorics, 2018, 25 (4), pp.P4.51
Article dans une revue
hal-01757839v1
|
||
Game colouring of the square of graphsDiscrete Mathematics, 2009, 309 (13), pp.4514-4521. ⟨10.1016/j.disc.2009.02.014⟩
Article dans une revue
istex
inria-00528116v1
|
|||
|
Islands in graphs on surfacesSIAM Journal on Discrete Mathematics, 2016, 30 (1), pp.206-219. ⟨10.1137/140957883⟩
Article dans une revue
hal-01119804v1
|
||
|
Distributed coloring in sparse graphs with fewer colorsACM Symposium on Principles of Distributed Computing (PODC 2018), Jul 2018, Egham, United Kingdom. pp.419-425, ⟨10.1145/3212734.3212740⟩
Communication dans un congrès
hal-01710649v1
|
||
|
Graphs with No Induced Five-Vertex Path or AntipathJournal of Graph Theory, 2017, 84 (3), pp.221-232. ⟨10.1002/jgt.22022⟩
Article dans une revue
hal-01438308v1
|
||
|
Optimal Adjacency Labels for Subgraphs of Cartesian Products50th International Colloquium on Automata, Languages, and Programming (ICALP 2023), Jul 2023, Paderborn, Germany. pp.57:1--57:11, ⟨10.4230/LIPIcs.ICALP.2023.57⟩
Communication dans un congrès
hal-03691409v1
|
||
|
A superlinear bound on the number of perfect matchings in cubic bridgeless graphsEuropean Journal of Combinatorics, 2012, 33 (5), pp.767-798. ⟨10.1016/j.ejc.2011.09.027⟩
Article dans une revue
hal-00635917v1
|
||
|
Acyclic improper colourings of graphs with bounded maximum degreeDiscrete Mathematics, 2010, 310 (2), pp.223-229. ⟨10.1016/j.disc.2008.09.009⟩
Article dans une revue
lirmm-00433038v1
|
||
|
Distance-two coloring of sparse graphsEuropean Journal of Combinatorics, 2014, 36, pp.406-415. ⟨10.1016/j.ejc.2013.09.002⟩
Article dans une revue
hal-00924022v1
|
||
|
Exact distance coloring in treesCombinatorics, Probability and Computing, 2019, 28 (2), pp.177-186. ⟨10.1017/S0963548318000378⟩
Article dans une revue
hal-01525789v1
|
||
|
On cubic bridgeless graphs whose edge-set cannot be covered by four perfect matchingsThe Seventh European Conference on Combinatorics, Graph Theory and Applications (EuroComb'13), Sep 2013, Pise, Italy. pp.47-51, ⟨10.1007/978-88-7642-475-5_8⟩
Communication dans un congrès
hal-00945884v1
|
||
|
Distributed coloring and the local structure of unit-disk graphsTheoretical Computer Science, 2023, 944, pp.113674. ⟨10.1016/j.tcs.2022.12.024⟩
Article dans une revue
hal-03269425v1
|
||
|
Local boxicityEuropean Journal of Combinatorics, 2022, 102, pp.103495. ⟨10.1016/j.ejc.2021.103495⟩
Article dans une revue
hal-03048296v1
|
||
|
Distributed coloring of graphs with an optimal number of colors36th International Symposium on Theoretical Aspects of Computer Science (STACS'19), Mar 2019, Berlin, Germany
Communication dans un congrès
hal-01963040v1
|