Filtrer vos résultats
- 24
- 21
- 27
- 11
- 2
- 2
- 1
- 1
- 1
- 1
- 42
- 15
- 2
- 1
- 1
- 1
- 1
- 3
- 1
- 2
- 1
- 6
- 4
- 5
- 1
- 5
- 3
- 8
- 1
- 2
- 42
- 3
- 27
- 26
- 4
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 45
- 14
- 8
- 6
- 6
- 5
- 4
- 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
45 résultats
|
|
|
triés par
|
|
|
From Path Graphs to Directed Path GraphsWG 2010 - 36th International Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2010, Zarós, Greece. pp.256-265, ⟨10.1007/978-3-642-16926-7_24⟩
Communication dans un congrès
istex
lirmm-00620726v1
|
||
|
|
Precoloring co-Meyniel graphsGraphs and Combinatorics, 2007, 23 (3), pp.291-301. ⟨10.1007/s00373-007-0724-1⟩
Article dans une revue
hal-00008354v1
|
||
|
|
2-Distance Coloring of Sparse GraphsJournal of Graph Theory, 2014, 77 (3), pp.190-218. ⟨10.1002/jgt.21782⟩
Article dans une revue
lirmm-01233451v1
|
||
|
|
A Bijection for Essentially 4-Connected Toroidal TriangulationsThe Electronic Journal of Combinatorics, 2019, 26 (1), pp.P1.13. ⟨10.37236/7897⟩
Article dans une revue
hal-02044281v1
|
||
|
|
Approximations for All-to-all Uniform Traffic Grooming on Unidirectional Ring[Research Report] 2007, pp.11
Rapport
inria-00175795v1
|
||
|
|
Asteroids in rooted and directed path graphsAlgorithmic Graph Theory, Centre for Discrete Mathematics and its applications (DIMAP), May 2009, Warwick, United Kingdom. pp.67-74
Communication dans un congrès
hal-00347163v2
|
||
|
|
Graph transformations preserving the stability numberDiscrete Applied Mathematics, 2012, 160, pp.2752-2759. ⟨10.1016/j.dam.2011.08.023⟩
Article dans une revue
lirmm-00736515v1
|
||
|
|
On the structure of Schnyder woods on orientable surfacesJournal of Computational Geometry, 2019, 10 (1), pp.127-164. ⟨10.20382/jocg.v10i1a5⟩
Article dans une revue
lirmm-02407874v1
|
||
|
|
Generalization of Schnyder woods to orientable surfaces and applicationsDiscrete Mathematics [cs.DM]. Université Grenoble Alpes, 2016
HDR
tel-01488943v1
|
||
|
|
Planar graphs with $\Delta \geq 7$ and no triangle adjacent to a $C_4$ are minimally edge and total choosableDiscrete Mathematics and Theoretical Computer Science, 2016, Vol. 17 no. 3 (3), pp.131-146. ⟨10.46298/dmtcs.2147⟩
Article dans une revue
lirmm-01347027v2
|
||
|
|
Erratum : MCColor is not optimal on Meyniel graphs2006
Pré-publication, Document de travail
hal-00001574v4
|
||
|
|
Graphs with maximum degree Δ≥17 and maximum average degree less than 3 are list 2-distance (Δ+2)-colorableDiscrete Mathematics, 2014, 317, pp.19-32. ⟨10.1016/j.disc.2013.10.022⟩
Article dans une revue
lirmm-01233453v1
|
||
|
|
Toroidal Maps: Schnyder Woods, Orthogonal Surfaces and Straight-Line RepresentationsDiscrete and Computational Geometry, 2014, 51 (1), pp.67-131. ⟨10.1007/s00454-013-9552-7⟩
Article dans une revue
lirmm-01263819v1
|
||
|
|
On graphs with no induced subdivision of K4Journal of Combinatorial Theory, Series B, 2012, 102, pp.924-947. ⟨10.1016/j.jctb.2012.04.005⟩
Article dans une revue
lirmm-00736503v1
|
||
|
|
Coloring Artemis graphsTheoretical Computer Science, 2009, 410, pp.2234-2240. ⟨10.1016/j.tcs.2009.02.012⟩
Article dans une revue
hal-00004741v1
|
||
Coloring bull-free perfectly contractile graphsSIAM Journal on Discrete Mathematics, 2008, 21, pp.999-1018
Article dans une revue
hal-00413109v1
|
|||
|
|
Triangle Contact Representations and Duality18th International Symposium on Graph Drawing (GD), Sep 2010, Konstanz, Germany. pp.262-273, ⟨10.1007/978-3-642-18469-7_24⟩
Communication dans un congrès
istex
lirmm-00620728v1
|
||
Contracting Chordal Graphs and Bipartite Graphs to Paths and TreesLAGOS: Latin-American Algorithms, Graphs and Optimization Symposium, Mar 2011, Bariloche, Argentina. pp.87-92
Communication dans un congrès
lirmm-00620732v1
|
|||
Graph Transformations Preserving the Stability NumberLAGOS: Latin-American Algorithms, Graphs and Optimization Symposium, Nov 2009, Gramado, Brazil. pp.3-8
Communication dans un congrès
lirmm-00620722v1
|
|||
|
|
List coloring the square of sparse graphs with large degreeEuropean Journal of Combinatorics, 2014, 41, pp.128-137. ⟨10.1016/j.ejc.2014.03.006⟩
Article dans une revue
lirmm-01233445v1
|
||
|
|
Asteroidal quadruples in non rooted path graphsDiscussiones Mathematicae Graph Theory, 2015, 35 (4), pp.603-614. ⟨10.7151/dmgt.1821⟩
Article dans une revue
lirmm-01348863v1
|
||
Sur un problème de diversitéConférence scientifique conjointe en Recherche Opérationnelle et Aide à la Décision - FRANCORO V / ROADEF/, Feb 2007, Grenoble, France
Communication dans un congrès
hal-00380232v1
|
|||
Coloring Meyniel graphs in linear timeInternational Colloquium on Graph Theory, 2005, Hyères, France
Communication dans un congrès
hal-00373072v1
|
|||
|
|
Encoding toroidal triangulationsDiscrete and Computational Geometry, 2017, 57 (3), pp.507-544. ⟨10.1007/s00454-016-9832-0⟩
Article dans une revue
hal-01488931v1
|
||
|
|
Triangle Contact Representations and DualityDiscrete and Computational Geometry, 2012, 48 (1), pp.239-254. ⟨10.1007/s00454-012-9400-1⟩
Article dans une revue
lirmm-00715024v1
|
||
|
|
Contracting Graphs to Paths and TreesIPEC 2011 - 6th International Symposium on Parameterized and Exact Computation, Sep 2011, Saarbrücken, Germany. pp.55-66, ⟨10.1007/978-3-642-28050-4_5⟩
Communication dans un congrès
lirmm-00805183v1
|
||
|
|
Approximations for All-to-all Uniform Traffic Grooming on Unidirectional RingJournal of Interconnection Networks, 2008, 9 (4), pp.471-486. ⟨10.1142/S0219265908002394⟩
Article dans une revue
inria-00429217v1
|
||
|
|
A bijection for essentially 3-connected toroidal mapsEuropean Journal of Combinatorics, 2021, 95, pp.103290. ⟨10.1016/j.ejc.2020.103290⟩
Article dans une revue
hal-03179865v1
|
||
|
|
Characterizing path graphs by forbidden induced subgraphsJournal of Graph Theory, 2009, 62 (4), pp.369-384. ⟨10.1002/jgt.20407⟩
Article dans une revue
hal-00261413v3
|
||
Detecting induced subgraphsEUROCOMB'07, 2007, Seville, Spain. pp.207--211
Communication dans un congrès
hal-00265499v1
|
- 1
- 2