Filtrer vos résultats
- 16
- 12
- 16
- 7
- 3
- 2
- 2
- 25
- 8
- 1
- 4
- 1
- 2
- 1
- 1
- 7
- 3
- 2
- 1
- 2
- 1
- 2
- 28
- 15
- 15
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 28
- 6
- 4
- 3
- 3
- 3
- 3
- 3
- 3
- 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
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
28 résultats
|
|
|
triés par
|
The Erdos-Posa property for long circuitsCombinatorica, 2007, pp.135-145
Article dans une revue
hal-00730773v1
|
|||
Minima in branching random walksAnnals of Probability, 2009, 37, pp.1044―1079
Article dans une revue
hal-00795281v1
|
|||
|
|
Polynomial-time recognition of clique-width ≤3 graphsDiscrete Applied Mathematics, 2012, Fourth Workshop on Graph Classes, Optimization, and Width Parameters Bergen, Norway, October 2009: Bergen GROW 09, 160 (6), pp.834-865. ⟨10.1016/j.dam.2011.03.020⟩
Article dans une revue
hal-01274081v1
|
||
|
|
Removable cycles in non-bipartite graphsJournal of Combinatorial Theory, Series B, 2009, 99, pp.30―38. ⟨10.1016/j.jctb.2008.03.007⟩
Article dans une revue
hal-00795287v1
|
||
|
|
A variant of the Erdős‐Sós conjectureJournal of Graph Theory, 2020, 94 (1), pp.131-158. ⟨10.1002/jgt.22511⟩
Article dans une revue
hal-02497401v1
|
||
|
|
Acyclic edge colourings of graphs with large girthRandom Structures and Algorithms, 2017, 50 (4), pp.511 - 533. ⟨10.1002/rsa.20695⟩
Article dans une revue
hal-01641019v1
|
||
A general critical condition for the emergence of a giant component in random graphs with given degreesEuropean Conference on Combinatorics, Graph Theory and Applications (Eurocomb 2009), 2009, Bordeaux, France. pp.639―645
Communication dans un congrès
hal-00795285v1
|
|||
Even PairsJorge L. Ramirez Alfonsin et Bruce A. Reed. Perfect Graphs, John Wiley and Sons Ltd., 23 p, 2001, Wiley-Interscience Series in Discrete Mathematics and Optimization
Chapitre d'ouvrage
inria-00100553v1
|
|||
Bull-Reducible Berge Graphs are PerfectEuroconference on Combinatorics, Graph Theory and Applications - COMB'01, 2001, Barcelone, Spain, 3 p
Communication dans un congrès
inria-00100577v1
|
|||
|
|
Star Coloring of GraphsJournal of Graph Theory, 2004, 47 (3), pp.163-182
Article dans une revue
hal-00307788v1
|
||
Tree-width of graphs without a 3 by 3 graph minorDiscrete Applied Mathematics, 2009, 157 (12), pp.2577-2596
Article dans une revue
hal-00730791v1
|
|||
|
|
List colouring squares of planar graphs[Research Report] RR-6586, INRIA. 2008
Rapport
inria-00303303v1
|
||
Almost All F-Free Graphs Have The Erdos-Hajnal PropertyAn Irregular Mind, 21, pp.405-414, 2010, ⟨10.1007/978-3-642-14444-8_11⟩
Chapitre d'ouvrage
istex
lirmm-00806800v1
|
|||
Brambles, prisms and gridsGraph Theory in Paris - Proceedings of a Conference in Memory of Claude Berge, Birkhauser, pp.37-44, 2007
Chapitre d'ouvrage
hal-00730790v1
|
|||
|
|
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
|
||
Polyhedral results on the stable set problem in graphs containing even or odd pairsMathematical Programming, 2017, ⟨10.1007/s10107-017-1168-x⟩
Article dans une revue
hal-01641023v1
|
|||
|
|
Coloring Artemis graphsTheoretical Computer Science, 2009, 410, pp.2234-2240. ⟨10.1016/j.tcs.2009.02.012⟩
Article dans une revue
hal-00004741v1
|
||
|
|
Oriented trees in digraphs.[Research Report] RR-7502, INRIA. 2011
Rapport
inria-00551133v1
|
||
|
|
Existence of Spanning ℱ-Free Subgraphs with Large Minimum DegreeCombinatorics, Probability and Computing, 2017, 26 (03), pp.448 - 467. ⟨10.1017/S0963548316000328⟩
Article dans une revue
hal-01641020v1
|
||
|
|
Fast separation in a graph with an excluded minor2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 2005, Berlin, Germany. pp.45-50, ⟨10.46298/dmtcs.3419⟩
Communication dans un congrès
hal-01184376v1
|
||
On planar quasi-parity graphsSIAM Journal on Discrete Mathematics, 2008, 22, pp.329-347
Article dans une revue
hal-00413115v1
|
|||
|
|
How to determine if a random graph with a fixed degree sequence has a giant componentProbability Theory and Related Fields, 2017, ⟨10.1007/s00440-017-0757-1⟩
Article dans une revue
hal-01641473v1
|
||
|
|
Oriented trees in digraphsDiscrete Mathematics, 2013, 313 (8), pp.967-974. ⟨10.1016/j.disc.2013.01.011⟩
Article dans une revue
hal-00821609v1
|
||
|
|
On the odd-minor variant of Hadwiger's conjectureJournal of Combinatorial Theory, Series B, 2009, 99, pp.20―29
Article dans une revue
hal-00795995v1
|
||
|
|
L(2,1)-labelling of graphsACM-SIAM symposium on Discrete algorithms (SODA 2008), Jan 2008, San Francisco, California, United States. pp.621-630
Communication dans un congrès
inria-00486183v1
|
||
|
|
An upper bound for the chromatic number of line graphs2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 2005, Berlin, Germany. pp.151-156, ⟨10.46298/dmtcs.3401⟩
Communication dans un congrès
hal-01184357v1
|
||
|
|
The Diameter of the Minimum Spanning Tree of a Complete GraphFourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities, 2006, Nancy, France. pp.237-248, ⟨10.46298/dmtcs.3513⟩
Communication dans un congrès
hal-01184718v1
|
||
Fractionally Edge Colouring Graphs with Large Maximum Degree in Linear TimeEuropean Conference on Combinatorics, Graph Theory and Applications (Eurocomb 2009), 2009, Bordeaux, France. pp.47―51, ⟨10.1016/j.endm.2009.07.008⟩
Communication dans un congrès
istex
hal-00795286v1
|