Filtrer vos résultats
- 165
- 13
- 78
- 67
- 26
- 4
- 2
- 1
- 57
- 1
- 175
- 14
- 1
- 1
- 7
- 11
- 7
- 6
- 5
- 12
- 4
- 15
- 8
- 9
- 8
- 14
- 14
- 12
- 14
- 6
- 6
- 5
- 2
- 3
- 3
- 5
- 1
- 173
- 4
- 1
- 178
- 178
- 29
- 25
- 17
- 15
- 13
- 10
- 7
- 7
- 6
- 5
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 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
- 178
- 26
- 18
- 14
- 13
- 12
- 12
- 10
- 10
- 10
- 9
- 9
- 8
- 8
- 8
- 6
- 6
- 6
- 5
- 5
- 5
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 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
- 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
178 résultats
|
|
Subdivisions of oriented cycles in digraphs with large chromatic numberBordeaux Graph Wokshop 2016, Nov 2016, Bordeaux, France. pp.85-88
Communication dans un congrès
hal-01411115v1
|
||
|
|
Choosability of the square of planar subcubic graphs with large girthDiscrete Mathematics, 2009, 309, pp.3553--3563
Article dans une revue
inria-00496423v1
|
||
|
|
Design of fault tolerant on board networks with priorities via selectorsRR-4463, INRIA. 2002
Rapport
inria-00072125v1
|
||
|
|
Complexity of greedy edge-colouringJournal of the Brazilian Computer Society, 2015, 21 (18), ⟨10.1186/s13173-015-0036-x⟩
Article dans une revue
hal-01233312v1
|
||
|
|
Groupage sur le chemin pour borner la largeur de coupeAlgoTel 2023 - 25èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, May 2023, Cargese, France. pp.4
Communication dans un congrès
hal-04076999v2
|
||
|
|
On the proper orientation number of bipartite graphsTheoretical Computer Science, 2015, 566, pp.59-75. ⟨10.1016/j.tcs.2014.11.037⟩
Article dans une revue
hal-01101578v1
|
||
|
|
On the unavoidability of oriented treesJournal of Combinatorial Theory, Series B, 2021, 151, pp.83-110. ⟨10.1016/j.jctb.2021.06.003⟩
Article dans une revue
hal-03269226v1
|
||
|
|
Proper orientation of cactiTheoretical Computer Science, 2016, 639, pp.14-25. ⟨10.1016/j.tcs.2016.05.016⟩
Article dans une revue
hal-01338646v1
|
||
|
|
Constrained ear decompositions in graphs and digraphsDiscrete Mathematics and Theoretical Computer Science, 2019, vol. 21 no. 4, ⟨10.23638/DMTCS-21-4-3⟩
Article dans une revue
hal-01798795v3
|
||
|
|
Enumerating the edge-colourings and total colourings of a regular graphJournal of Combinatorial Optimization, 2013, 25 (4), pp.523-535. ⟨10.1007/s10878-011-9448-5⟩
Article dans une revue
hal-00821598v1
|
||
|
|
On the Complexity of Compressing Two Dimensional Routing Tables with OrderAlgorithmica, 2018, 80 (1), pp.209 - 233. ⟨10.1007/s00453-016-0243-7⟩
Article dans une revue
hal-01686641v1
|
||
|
|
Oriented trees in digraphs.[Research Report] RR-7502, INRIA. 2011
Rapport
inria-00551133v1
|
||
|
|
Choosability of the square of planar subcubic graphs with large girth[Research Report] RR-5800, INRIA. 2006, pp.17
Rapport
inria-00070223v1
|
||
|
|
Conflict coloring problems: (theory, complexity, algorithm), and application to multi-resolution modeling in structural bioinformatics2022
Pré-publication, Document de travail
hal-03666380v1
|
||
|
|
List circular backbone colouringDiscrete Mathematics and Theoretical Computer Science, 2014, Vol. 16 no. 1 (1), pp.89--104. ⟨10.46298/dmtcs.1258⟩
Article dans une revue
hal-01179209v1
|
||
|
|
(Circular) backbone colouring: forest backbones in planar graphsDiscrete Applied Mathematics, 2014, 169, pp.119-134. ⟨10.1016/j.dam.2014.01.011⟩
Article dans une revue
hal-00957243v1
|
||
Spanning galaxies in digraphsEuroComb: European Conference on Combinatorics, Graph Theory and Applications, Sep 2009, Bordeaux, France. pp.139-143, ⟨10.1016/j.endm.2009.07.023⟩
Communication dans un congrès
istex
lirmm-00433050v1
|
|||
|
|
On the Minimum Number of Arcs in 4-Dicritical Oriented GraphsWG 2023 - International Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2023, Fribourg, Switzerland. pp.376-387, ⟨10.1007/978-3-031-43380-1_27⟩
Communication dans un congrès
hal-04352253v1
|
||
|
|
On the dichromatic number of surfacesExtended Abstracts EuroComb 2021, 14, Springer International Publishing, pp.181-187, 2021, Trends in Mathematics, ⟨10.1007/978-3-030-83823-2_29⟩
Chapitre d'ouvrage
hal-03424140v1
|
||
|
|
Overlaying a hypergraph with a graph with bounded maximum degreeALGOTEL 2020 – 22èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Sep 2020, Lyon, France
Communication dans un congrès
hal-02796730v1
|
||
|
|
Good edge-labelling of graphs.Discrete Applied Mathematics, 2012, V Latin American Algorithms, Graphs, and Optimization Symposium -- Gramado, Brazil, 2009, 160 (18), pp.2502-2513. ⟨10.1016/j.dam.2011.07.021⟩
Article dans une revue
inria-00639005v1
|
||
|
|
Exact algorithms for $L(2,1)$-labeling of graphs[Research Report] RR-6587, INRIA. 2008
Rapport
inria-00303330v1
|
||
|
|
Enumerating the edge-colourings and total colourings of a regular graph[Research Report] RR-7652, INRIA. 2011
Rapport
inria-00602188v1
|
||
|
|
Linear and 2-frugal choosability of graphs of small maximum average degree[Research Report] RR-7213, INRIA. 2010
Rapport
inria-00459692v1
|
||
|
|
Griggs and Yeh's Conjecture and L(p,1)-labelingsSIAM Journal on Discrete Mathematics, 2012, 26 (1), pp.145--168. ⟨10.1137/090763998⟩
Article dans une revue
inria-00327909v2
|
||
|
|
Subdivisions of oriented cycles in digraphs with large chromatic number[Research Report] RR-8865, LRI - CNRS, University Paris-Sud; LIP - ENS Lyon; INRIA Sophia Antipolis - I3S. 2016, pp.25
Rapport
hal-01277578v1
|
||
|
|
Steinberg's Conjecture and near-colorings[Research Report] RR-7669, INRIA. 2011
Rapport
inria-00605810v1
|
||
|
|
On the Unavoidability of Oriented TreesElectronic Notes in Theoretical Computer Science, 2019, 346, pp.425-436. ⟨10.1016/j.entcs.2019.08.038⟩
Article dans une revue
hal-02350215v1
|
||
|
|
Finding a subdivision of a digraphTheoretical Computer Science, 2015, 562, pp.20
Article dans une revue
hal-01111374v1
|
||
|
|
Cooperative colorings of trees and of bipartite graphsThe Electronic Journal of Combinatorics, 2020
Article dans une revue
hal-02497425v1
|