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
|
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
|
||
|
New bounds on the Grundy number of products of graphsJournal of Graph Theory, 2012, 71 (1), pp.78--88
Article dans une revue
hal-00749190v1
|
||
|
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
|
||
|
Steinberg-like theorems for backbone colouringDiscrete Applied Mathematics, 2018, ⟨10.1016/j.dam.2017.03.009⟩
Article dans une revue
hal-01796713v1
|
||
|
Routage vert et compression de règles SDNALGOTEL 2015 — 17èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Jun 2015, Beaune, France
Communication dans un congrès
hal-01148471v1
|
||
|
On the (non-)existence of polynomial kernels for $P_l$-free edge modification problemsAlgorithmica, 2013, 65 (4), pp.900-926. ⟨10.1007/s00453-012-9619-5⟩
Article dans une revue
hal-00821612v1
|
||
|
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
|
||
Arc-chromatic number of digraphs in which every vertex has bounded outdegree or bounded indegreeJournal of Graph Theory, 2006, 53 (4), pp.315-332. ⟨10.1002/jgt.20189⟩
Article dans une revue
istex
lirmm-00153978v1
|
|||
|
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
|
||
|
Bipartite spanning sub(di)graphs induced by 2-partitionsJournal of Graph Theory, 2019, 92 (2), pp.130-151. ⟨10.1002/jgt.22444⟩
Article dans une revue
hal-02350210v1
|
||
|
Complexity Dichotomies for the Minimum F-Overlay Problem[Research Report] RR-9045, Inria Sophia Antipolis. 2013, pp.16
Rapport
hal-01490535v1
|
||
|
On Spanning Galaxies in DigraphsDiscrete Applied Mathematics, 2012, 160 (6), pp.744-754. ⟨10.1016/j.dam.2011.07.013⟩
Article dans une revue
hal-00749191v1
|
||
|
Detection number of bipartite graphs and cubic graphs[Research Report] RR-8115, INRIA. 2012, pp.17
Rapport
hal-00744365v1
|
||
|
Grundy number and products of graphs[Research Report] RR-6672, INRIA. 2008
Rapport
inria-00328589v1
|
||
|
b-coloring of tight graphsDiscrete Applied Mathematics, 2012, 160 (18), pp.2709--2715
Article dans une revue
hal-00749192v1
|
||
|
Good edge-labelling of graphs[Research Report] RR-6934, INRIA. 2009, pp.16
Rapport
inria-00383343v4
|
||
|
b-coloring of tight graphs[Research Report] RR-7241, INRIA. 2010
Rapport
inria-00468734v2
|
||
|
Facial non-repetitive edge-colouring of plane graphsJournal of Graph Theory, 2011, 66 (1), pp.38--48. ⟨10.1002/jgt.20488⟩
Article dans une revue
istex
inria-00638439v1
|
||
|
Allocation de fréquences et coloration impropre des graphes hexagonaux pondérés9ème Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, May 2007, Ile d'Oléron, France. pp.53-56
Communication dans un congrès
inria-00176955v1
|
||
|
On the dichromatic number of surfaces[Research Report] Inria; CNRS; I3S; Université Côte D'Azur. 2021
Rapport
hal-03269426v1
|
||
|
Finding a subdivision of a prescribed digraph of order 4Journal of Graph Theory, 2018, 87 (4), pp.536-560. ⟨10.1002/jgt.22174⟩
Article dans une revue
hal-01711403v1
|