Filtrer vos résultats
- 18
- 13
- 21
- 5
- 2
- 2
- 1
- 23
- 16
- 1
- 1
- 5
- 5
- 3
- 1
- 4
- 4
- 2
- 3
- 2
- 30
- 1
- 19
- 10
- 5
- 4
- 3
- 3
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 31
- 8
- 6
- 4
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 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
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
31 résultats
|
|
triés par
|
|
Isometric embeddings of subidivided complete graphs in the hypercubeSIAM Journal on Discrete Mathematics, 2008, 22, pp.1226--1238. ⟨10.1137/070681909⟩
Article dans une revue
hal-00187039v1
|
||
|
A De Bruijn–Erdős theorem for chordal graphsThe Electronic Journal of Combinatorics, 2015, 22 (1), pp.1.70
Article dans une revue
hal-01263335v1
|
||
|
Homomorphisms of binary Cayley graphsDiscrete Mathematics, 2015, 338, pp.2539--2544. ⟨10.1016/j.disc.2015.06.025⟩
Article dans une revue
hal-02093572v1
|
||
A survey about Solitaire ClobberRichard Nowakowski. Games of No Chance, 4, MSRI Publications, 2015, 9781107011038
Chapitre d'ouvrage
hal-01283826v1
|
|||
|
On planarity of direct product of multipartite complete graphsDiscrete Mathematics, Algorithms and Applications, 2009, 1 (1), pp.85-104. ⟨10.1142/S179383090900004X⟩
Article dans une revue
hal-00387303v1
|
||
Encoding partial orders through modular decompositionJournal of computational science, 2018, 25, pp.446-455
Article dans une revue
hal-01995145v1
|
|||
|
Broadcast domination and multipacking: bounds and the integrality gapThe Australasian Journal of Combinatorics, 2019, 74 (1), pp.86-97
Article dans une revue
hal-03041313v1
|
||
|
A lower bound on the size of an absorbing set in an arc-coloured tournamentDiscrete Mathematics, 2019, 342, pp.143--144. ⟨10.1016/j.disc.2018.09.013⟩
Article dans une revue
hal-02093568v1
|
||
Bisplit graphs satisfy the Chen-Chvátal conjectureCoRR, 2018, abs/1808.08710
Article dans une revue
hal-02093570v1
|
|||
|
Bounding the Number of Minimal Transversals in Tripartite 3-Uniform HypergraphsDiscrete Mathematics and Theoretical Computer Science, 2023, vol. 23 no. 2, special issue in honour of Maurice Pouzet, ⟨10.46298/dmtcs.7129⟩
Article dans une revue
hal-01847459v7
|
||
On the Sharpness of Some Results Relating Cuts and Crossing NumbersThe Electronic Journal of Combinatorics, 2010, 17
Article dans une revue
hal-02093577v1
|
|||
Bounds on Directed star arboricity in some digraph classesElectronic Notes in Discrete Mathematics, 2017, 62, pp.267 - 272. ⟨10.1016/j.endm.2017.10.046⟩
Article dans une revue
hal-01784822v1
|
|||
|
Algorithms for k-meet-semidistributive latticesTheoretical Computer Science, 2017, 658, pp.391 - 398. ⟨10.1016/j.tcs.2015.10.029⟩
Article dans une revue
hal-01571243v1
|
||
A survey on Solitaire Clobber"Games of no Chance 4". Cambridge University Press, 2015
Chapitre d'ouvrage
hal-02004245v1
|
|||
|
Bounding the Order of a Graph Using Its Diameter and Metric Dimension: A Study Through Tree Decompositions and VC DimensionSIAM Journal on Discrete Mathematics, 2018, 32 (2), pp.902 - 918. ⟨10.1137/16M1097833⟩
Article dans une revue
hal-01848648v1
|
||
Du nombre maximum d'ensembles fermés en 3 dimensionsExtraction et Gestion des connaissances, 2019, Metz, France. pp.345--350
Communication dans un congrès
hal-02093569v1
|
|||
Partial Duplication of Convex Sets in LatticesProceedings of the Thirteenth International Conference on Concept Lattices and Their Applications, 2016, Moscow, Russia. pp.33--43
Communication dans un congrès
hal-02093571v1
|
|||
Lines in hypergraphsCombinatorica, 2013, 33, pp.633--654. ⟨10.1007/s00493-013-2910-5⟩
Article dans une revue
istex
hal-02093573v1
|
|||
|
Covering codes in Sierpinski graphsDiscrete Mathematics and Theoretical Computer Science, 2010, Vol. 12 no. 3 (3), pp.63-74. ⟨10.46298/dmtcs.508⟩
Article dans une revue
hal-00990423v1
|
||
|
Homomorphism bounds of signed bipartite K4-minor-free graphs and edge-colorings of 2k-regular K4-minor-free multigraphsDiscrete Applied Mathematics, 2019, 261, pp.40-51. ⟨10.1016/j.dam.2018.09.004⟩
Article dans une revue
hal-01915269v1
|
||
|
Homomorphism bounds and edge-colourings of K4-minor-free graphsJournal of Combinatorial Theory, Series B, 2017, 124, pp.128-164. ⟨10.1016/j.jctb.2017.01.001⟩
Article dans une revue
hal-01520741v1
|
||
Making a Graph Crossing-Critical by Multiplying its EdgesThe Electronic Journal of Combinatorics, 2013, 20, pp.P61
Article dans une revue
hal-02093574v1
|
|||
|
Complexity of Conjunctive Regular Path Query HomomorphismsConference on Computability in Europe (CiE 2019), Jul 2019, Durham, United Kingdom. pp.108-119, ⟨10.1007/978-3-030-22996-2_10⟩
Communication dans un congrès
hal-02288666v1
|
||
|
Octal Games on Graphs: The game 0.33 on subdivided stars and bistarsTheoretical Computer Science, 2018, 746, pp.19-35. ⟨10.1016/j.tcs.2018.06.018⟩
Article dans une revue
hal-01418153v3
|
||
|
Autour de problèmes de plongements de graphesMathématiques [math]. Université Joseph-Fourier - Grenoble I, 2009. Français. ⟨NNT : ⟩
Thèse
tel-00401226v1
|
||
|
Subdivided graphs as isometric subgraphs of Hamming graphsEuropean Journal of Combinatorics, 2009, 30, pp.1062--1070. ⟨10.1016/j.ejc.2008.09.011⟩
Article dans une revue
hal-00192300v1
|
||
Hardness and Algorithms for Variants of Line Graphs of Directed GraphsInternational Symposium on Algorithms and Computation, Dec 2013, Hong-Kong, China. pp.196-206, ⟨10.1007/978-3-642-45030-3_19⟩
Communication dans un congrès
istex
hal-02082711v1
|
|||
|
Drawing disconnected graphs on the Klein bottle2008
Pré-publication, Document de travail
hal-00363494v1
|
||
On a class of intersection graphsCoRR, 2013, abs/1306.2498
Article dans une revue
hal-02093575v1
|
|||
|
Octal Games on Graphs: The game 0.33 on subdivided stars and bistars. Full proof of Theorem 222018
Pré-publication, Document de travail
hal-01807116v1
|
- 1
- 2