Filtrer vos résultats
- 5
- 4
- 6
- 2
- 1
- 8
- 4
- 2
- 1
- 1
- 2
- 1
- 1
- 1
- 9
- 6
- 4
- 1
- 1
- 1
- 9
- 4
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
9 résultats
|
|
|
triés par
|
Minmax degree of graphs (Extended abstract)The Sixth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2011, 2011, Budapest, Hungary. ⟨10.1016/j.endm.2011.09.042⟩
Communication dans un congrès
istex
lirmm-01264283v1
|
|||
Trinque problem: covering complete graphs by plane degree-bounded hypergraphsJournal of Combinatorial Optimization, 2017, 33 (2), pp.543 - 550. ⟨10.1007/s10878-015-9978-3⟩
Article dans une revue
hal-01686552v1
|
|||
|
|
The Coloring Game on Planar Graphs with Large Girth, by a result on Sparse Cactuses2015
Pré-publication, Document de travail
hal-01175659v1
|
||
|
|
Homomorphisms of sparse signed graphsThe Electronic Journal of Combinatorics, 2020, 27 (3), ⟨10.37236/8478⟩
Article dans une revue
hal-03035030v1
|
||
The incidence game chromatic number of (a,d)-decomposable graphsJournal of Discrete Algorithms, 2015, 31, pp.14-25
Article dans une revue
hal-02264654v1
|
|||
|
|
Incidence coloring game and arboricity of graphsInternational Workshop on Combinatorial Algorithms, Jul 2013, Rouen, France. pp.106-114
Communication dans un congrès
hal-00804128v2
|
||
On the game coloring index of F+-decomposable graphsDiscrete Applied Mathematics, 2018, 236, pp.73-83
Article dans une revue
hal-01883462v1
|
|||
|
|
A Connected Version of the Graph Coloring GameDiscrete Applied Mathematics, In press, 283, pp.744-750. ⟨10.1016/j.dam.2020.03.012⟩
Article dans une revue
hal-02192578v3
|
||
L(p,q)-labeling of sparse graphsJournal of Combinatorial Optimization, 2012, 25 (4), pp.646-660. ⟨10.1007/s10878-012-9507-6⟩
Article dans une revue
istex
lirmm-00738574v1
|