1. Recherche
23 résultats  enregistrer la recherche
...
hal-00693334v3  Pré-publication, Document de travail
Florent Jouve, Jean-Sébastien Sereni. Expander graphs and sieving in combinatorial structures
2017
...
hal-00779634v3  Article dans une revue
Zdeněk Dvořák, Jean-Sébastien Sereni, Jan Volec. Subcubic triangle-free graphs have fractional chromatic number at most $14/5$
Journal of the London Mathematical Society, London Mathematical Society, 2014, 89 (3), pp.641--662. <http://dx.doi.org/10.1112/jlms/jdt085>
...
hal-01433349v1  Pré-publication, Document de travail
Zdeněk Dvořák, Jean-Sébastien Sereni. Do triangle-free planar graphs have exponentially many 3-colorings?
2017
...
hal-01483972v1  Pré-publication, Document de travail
Rémi De Joannis de Verclos, Jean-Sébastien Sereni. Equitable Colorings of $K_4$-minor-free Graphs
2017
...
hal-00802000v1  Article dans une revue
Andrew P. Dove, Jerrold R. Griggs, Ross J. Kang, Jean-Sébastien Sereni. Supersaturation in the Boolean lattice
Integers : Electronic Journal of Combinatorial Number Theory, State University of West Georgia, Charles University, and DIMATIA, 2014, The Dick de Bruijn Memorial Volume, 14A, pp.A4. <http://www.integers-ejcnt.org/vol14a.html>
...
hal-00932924v1  Rapport
Jan Van den Heuvel, Daniel Král', Martin Kupec, Jean-Sébastien Sereni, Jan Volec. Extensions of Fractional Precolorings show Discontinuous Behavior
[Research Report] Loria & Inria Grand Est. 2012
...
hal-00686989v2  Rapport
Daniel Král', Chun-Hung Liu, Jean-Sébastien Sereni, Peter Whalen, Zelealem Yilma. A new bound for the 2/3 conjecture
[Research Report] Loria & Inria Grand Est. 2012
hal-01172466v1  Communication dans un congrès
Xavier Goaoc, Alfredo Hubard, Rémi De Joannis de Verclos, Jean-Sébastien Sereni, Jan Volec. Limits of order types
Janos Pach, Larse Arge. Symposium on Computational Geometry 2015, Jun 2015, Eindhoven, Netherlands. 34, pp.876, 2015, Symposium on Computational Geometry 2015: Eindhoven, The Netherlands. <10.4230/LIPIcs.SOCG.2015.300>
...
hal-01289470v1  Article dans une revue
Matjaž Krnc, Jean-Sébastien Sereni, Ristě Skrekovski, Zelealem Yilma. Closeness Centralization Measure for Two-mode Data of Prescribed Sizes
Network Science, 2016
...
hal-01024843v2  Rapport
Katherine Edwards, António Girão, Jan Van den Heuvel, Ross J. Kang, Gregory J. Puleo et al.  Extension from Precoloured Sets of Edges
[Research Report] Loria & Inria Grand Est. 2016
...
hal-01385481v1  Pré-publication, Document de travail
Matjaž Krnc, Jean-Sébastien Sereni, Ristě Skrekovski, Zelealem Yilma. Eccentricity of Networks with Structural Constraints
2015
...
hal-00992104v3  Pré-publication, Document de travail
Martin Loebl, Jean-Sébastien Sereni. Isomorphism of Weighted Trees and Stanley's Conjecture for Caterpillars
2017
...
hal-00793271v1  Rapport
Dieter Rautenbach, Jean-Sébastien Sereni. Transversals of Longest Paths and Cycles
[Research Report] Loria & Inria Grand Est. 2013
...
hal-00487085v1  Article dans une revue
Daniel Král', Edita Máčajová, Attila Pór, Jean-Sébastien Sereni. Characterization results for Steiner triple systems and their application to edge-colorings of cubic graphs
Canadian Journal of Mathematics (Journal Canadien de Mathématiques), 2010, 62 (2), pp.355--381. <10.4153/CJM-2010-021-9>
...
inria-00486183v1  Communication dans un congrès
Frédéric Havet, Bruce Reed, Jean-Sébastien Sereni. L(2,1)-labelling of graphs
ACM-SIAM symposium on Discrete algorithms (SODA 2008), Jan 2008, San Francisco, California, United States. pp.621-630, 2008, <http://portal.acm.org/citation.cfm?id=1347082.1347151>
...
hal-00912562v1  Article dans une revue
Daniel Král', Lukáš Mach, Jean-Sébastien Sereni. A New Lower Bound Based on Gromov's Method of Selecting Heavily Covered Points
Discrete and Computational Geometry, Springer Verlag, 2012, 48 (2), pp.487--498. <10.1007/s00454-012-9419-3>
...
hal-00996709v2  Article dans une revue
Stéphane Bessy, Daniel Gonçalves, Jean-Sébastien Sereni. Two floor building needing eight colors
Journal of Graph Algorithms and Applications (JGAA), Brown University, 2015, 19 (1), pp.1--9. <http://dx.doi.org/10.7155/jgaa.00344>
...
hal-00950493v2  Article dans une revue
Zdeněk Dvořák, Jean-Sébastien Sereni, Jan Volec. Fractional coloring of triangle-free planar graphs
Electronic Journal of Combinatorics, Electronic Journal of Combinatorics, 2015, 22 (4), pp.#P4.11. <http://www.combinatorics.org/ojs/index.php/eljc/article/view/v22i4p11/pdf>
...
hal-01398376v1  Article dans une revue
Rong Luo, Jean-Sébastien Sereni, D Stephens, Gexin Yu. Equitable Coloring of Sparse Planar Graphs
Siam Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2010, 24, pp.1572--1583. <10.1137/090751803>
hal-00487070v1  Article dans une revue
Frantisek Kardos, Daniel Kral, Jozef Miskuf, Jean-Sébastien Sereni. Fullerene graphs have exponentially many perfect matchings
Journal of Mathematical Chemistry, Springer Verlag (Germany), 2009, 46 (2), pp.443--447. <10.1007/s10910-008-9471-7>
hal-00487022v1  Article dans une revue
Daniel Král', Ondrej Pangrác, Jean-Sébastien Sereni, Riste Škrekovski. Long cycles in fullerene graphs
Journal of Mathematical Chemistry, Springer Verlag (Germany), 2009, 45 (4), pp.1021--1031. <10.1007/s10910-008-9390-7>
...
hal-00921122v1  Article dans une revue
Jean-Sébastien Sereni, Jan Volec. A note on acyclic vertex-colorings
Journal of Combinatorics, International Press, 2016, 7 (4), pp.725--737. <http://dx.doi.org/10.4310/JOC.2016.v7.n4.a8>
...
hal-01184358v1  Communication dans un congrès
Ross J. Kang, Tobias Müller, Jean-Sébastien Sereni. Improper colouring of (random) unit disk graphs
Stefan Felsner. 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 2005, Berlin, Germany. Discrete Mathematics and Theoretical Computer Science, DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), pp.193-198, 2005, DMTCS Proceedings

Contact


archive-ouverte@inria.fr