Filtrer vos résultats
- 22
- 11
- 20
- 8
- 2
- 2
- 1
- 33
- 7
- 1
- 3
- 1
- 4
- 4
- 2
- 1
- 1
- 1
- 4
- 1
- 5
- 2
- 3
- 31
- 2
- 33
- 7
- 7
- 7
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 33
- 9
- 9
- 6
- 6
- 5
- 4
- 4
- 3
- 3
- 3
- 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
33 résultats
|
|
|
triés par
|
|
|
From light edges to strong edge-colouring of 1-planar graphsDiscrete Mathematics and Theoretical Computer Science, 2020, vol. 22 no. 1 (2), ⟨10.23638/DMTCS-22-1-2⟩
Article dans une revue
hal-02112188v3
|
||
A note on strong edge-colouringBordeaux Graph Workshop 2012, 2012, Bordeaux, France
Communication dans un congrès
lirmm-01264278v1
|
|||
|
|
Bounds and complexity results for strong edge colouring of subcubic graphsEuroComb'11, Aug 2011, Budapest, France. A paraitre
Communication dans un congrès
hal-00592130v1
|
||
|
|
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
|
||
|
|
A note on the acyclic 3-choosability of some planar graphsDiscrete Applied Mathematics, 2010, 158 (10), pp.1104-1110. ⟨10.1016/j.dam.2010.02.005⟩
Article dans une revue
lirmm-01263813v1
|
||
|
|
Every planar graph without cycles of lengths 4 to 12 is acyclically 3-choosableInformation Processing Letters, 2009
Article dans une revue
hal-00402807v1
|
||
A Connected Version of the Graph Coloring GameThe 9th Slovenian International Conference on Graph Theory, Bledʼ19, 2019, Bled, Slovenia
Communication dans un congrès
hal-02264668v1
|
|||
|
|
Exact square coloring of subcubic planar graphsDiscrete Applied Mathematics, 2021, 293, pp.74-89. ⟨10.1016/j.dam.2021.01.007⟩
Article dans une revue
hal-02925881v3
|
||
|
|
Strong edge-colouring and induced matchingsInformation Processing Letters, 2013, 113 (19-21), pp.836-843. ⟨10.1016/j.ipl.2013.07.026⟩
Article dans une revue
hal-00609454v4
|
||
|
|
Incidence coloring of graphs with high maximum average degreeDiscrete Applied Mathematics, 2017, 227, pp.29--43. ⟨10.1016/j.dam.2017.04.029⟩
Article dans une revue
hal-02527073v1
|
||
|
|
Strong edge-colouring of sparse planar graphsDiscrete Applied Mathematics, 2014, ⟨10.1016/j.dam.2014.07.006⟩
Article dans une revue
hal-00932945v3
|
||
|
|
Edge Weights and Vertex Colours: Minimizing Sum CountDiscrete Applied Mathematics, 2019, 270, pp.13-24
Article dans une revue
hal-01839537v2
|
||
|
|
Robustesse des distances et du diamètre dans un réseau fragile23ème congrès annuel de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, INSA Lyon, Feb 2022, Villeurbanne - Lyon, France
Communication dans un congrès
hal-03595410v1
|
||
Graphs with maximum degree 6 are acyclically 11-colorableInformation Processing Letters, 2011, Volume 111 (Issue 15), pp.Pages 748-753
Article dans une revue
hal-00987694v1
|
|||
|
|
Acyclic coloring of graphs with maximum degree five2010
Autre publication scientifique
hal-00375166v1
|
||
|
|
On the algorithmic complexity of determining the AVD and NSD chromatic indices of graphsTheoretical Computer Science, 2023, 939, pp.105-118. ⟨10.1016/j.tcs.2022.10.017⟩
Article dans une revue
hal-03609262v2
|
||
|
|
On a List Variant of the Multiplicative 1-2-3 ConjectureGraphs and Combinatorics, 2022, 38 (3), pp.88. ⟨10.1007/s00373-022-02491-1⟩
Article dans une revue
hal-03120800v2
|
||
|
|
A general decomposition theory for the 1-2-3 Conjecture and locally irregular decompositionsDiscrete Mathematics and Theoretical Computer Science, 2019, ICGT 2018, vol. 21 no. 1, ICGT 2018 (1), ⟨10.23638/DMTCS-21-1-2⟩
Article dans une revue
hal-01690222v4
|
||
Adjacent vertex-distinguishing edge coloring of graphsEuroComb: European Conference on Combinatorics, Graph Theory and Applications, 2013, Pise, Italy. pp.313-318, ⟨10.1007/978-88-7642-475-5_50⟩
Communication dans un congrès
istex
lirmm-01264408v1
|
|||
Acyclic choosability of planar graphs : a Steinberg like approachEuroComb'09, European conference on Combinatorics, Graph Theory and Applications, Sep 2009, France. pp.199-205
Communication dans un congrès
hal-00401603v1
|
|||
|
|
Strong edge coloring of subcubic graphsDiscrete Applied Mathematics, 2011, 159 (15), pp.1650-1657. ⟨10.1016/j.dam.2011.06.015⟩
Article dans une revue
hal-00592185v1
|
||
|
|
Parameterized Complexity of Edge-Coloured and Signed Graph Homomorphism ProblemsIPEC 2019, Sep 2019, Munich, Germany. pp.15:1-16, ⟨10.4230/LIPIcs.IPEC.2019.15⟩
Communication dans un congrès
hal-02491871v1
|
||
|
|
Between proper and strong edge-colorings of subcubic graphs2020
Pré-publication, Document de travail
hal-02984468v1
|
||
|
|
A note on the acyclic 3-choosability of some planar graphs2009
Autre publication scientifique
hal-00425986v1
|
||
|
|
On a total version of 1,2,3 Conjecture2018
Pré-publication, Document de travail
hal-01754080v1
|
||
Adjacent vertex-distinguishing edge coloring of graphs with maximum degree $\Delta$Journal of Combinatorial Optimization, 2013, 26 (1), pp.152-160. ⟨10.1007/s10878-011-9444-9⟩
Article dans une revue
istex
lirmm-00782842v1
|
|||
|
|
Strong edge coloring sparse graphsElectronic Notes in Discrete Mathematics, 2015, The Eight European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2015, 49, pp.773-778. ⟨10.1016/j.endm.2015.06.104⟩
Article dans une revue
lirmm-01264420v1
|
||
Adjacent vertex-distinguishing edge coloring of graphs with maximum degree at least fiveElectronic Notes in Discrete Mathematics, 2011, 38, pp.457-462. ⟨10.1016/j.endm.2011.09.074⟩
Article dans une revue
istex
lirmm-01264287v1
|
|||
|
|
Colorations de graphes sous contraintesMathématique discrète [cs.DM]. Université Sciences et Technologies - Bordeaux I, 2011. Français. ⟨NNT : ⟩
Thèse
tel-00987686v1
|
||
|
|
On strong edge-colouring of subcubic graphsDiscrete Applied Mathematics, 2013, 161 (16-17), pp.2467-2479. ⟨10.1016/j.dam.2013.05.021⟩
Article dans une revue
hal-00686021v2
|
- 1
- 2