I agree that this site is using cookies. You can find further informations here.
X
Bessy, Stéphane
233  results:
Search for persons X
?
1

FPT algorithms for packing k-safe spanning rooted sub(di)gr..:

Bessy, Stéphane ; Hörsch, Florian ; Maia, Ana Karolinna..
Discrete Applied Mathematics.  346 (2024)  - p. 80-94 , 2024
Link: https://doi.org/10.1016/..
 
?
2

Complementary cycles of any length in regular bipartite tou..:

Bessy, Stéphane ; Thiebaut, Jocelyn
Journal of Graph Theory.  103 (2022)  2 - p. 186-211 , 2022
Link: https://doi.org/10.1002/..
 
?
3

Exponential independence in subcubic graphs:

Bessy, Stéphane ; Pardey, Johannes ; Rautenbach, Dieter
Discrete Mathematics.  344 (2021)  8 - p. 112439 , 2021
Link: https://doi.org/10.1016/..
 
?
4

Arc‐disjoint in‐ and out‐branchings in digraphs of independ..:

Bang‐Jensen, Jørgen ; Bessy, Stéphane ; Havet, Frédéric.
Journal of Graph Theory.  100 (2021)  2 - p. 294-314 , 2021
Link: https://doi.org/10.1002/..
 
?
5

Packing Arc-Disjoint Cycles in Tournaments:

Bessy, Stéphane ; Bougeret, Marin ; Krithika, R....
Algorithmica.  83 (2021)  5 - p. 1393-1420 , 2021
Link: https://doi.org/10.1007/..
 
?
6

Maximal Wiener index for graphs with prescribed number of b..:

Bessy, Stéphane ; Dross, François ; Hriňáková, Katarína..
Applied Mathematics and Computation.  380 (2020)  - p. 125274 , 2020
Link: https://doi.org/10.1016/..
 
?
7

Good orientations of unions of edge‐disjoint spanning trees:

Bang‐Jensen, Jørgen ; Bessy, Stéphane ; Huang, Jing.
Journal of Graph Theory.  96 (2020)  4 - p. 594-618 , 2020
Link: https://doi.org/10.1002/..
 
?
8

Graphs with the second and third maximum Wiener indices ove..:

Bessy, Stéphane ; Dross, François ; Knor, Martin.
Discrete Applied Mathematics.  284 (2020)  - p. 195-200 , 2020
Link: https://doi.org/10.1016/..
 
?
9

On independent set in B1-EPG graphs:

Bessy, Stephane ; Bougeret, Marin ; Chaplick, Steven..
Discrete Applied Mathematics.  278 (2020)  - p. 62-72 , 2020
Link: https://doi.org/10.1016/..
 
?
10

Dynamic monopolies for interval graphs with bounded thresho..:

Bessy, Stéphane ; Ehard, Stefan ; Penso, Lucia D..
Discrete Applied Mathematics.  260 (2019)  - p. 256-261 , 2019
Link: https://doi.org/10.1016/..
 
?
11

Out‐colourings of digraphs:

Alon, Noga ; Bang‐Jensen, Jørgen ; Bessy, Stéphane
Journal of Graph Theory.  93 (2019)  1 - p. 88-112 , 2019
Link: https://doi.org/10.1002/..
 
?
12

Degree-constrained 2-partitions of graphs:

Bang-Jensen, Jørgen ; Bessy, Stéphane
Theoretical Computer Science.  776 (2019)  - p. 64-74 , 2019
Link: https://doi.org/10.1016/..
 
?
13

The structure of graphs with given number of blocks and the..:

Bessy, Stéphane ; Dross, François ; Hriňáková, Katarína..
Journal of Combinatorial Optimization.  39 (2019)  1 - p. 170-184 , 2019
Link: https://doi.org/10.1007/..
 
?
14

The Geodetic Hull Number is Hard for Chordal Graphs:

Bessy, Stéphane ; Dourado, Mitre C. ; Penso, Lucia D..
SIAM Journal on Discrete Mathematics.  32 (2018)  1 - p. 543-547 , 2018
Link: https://doi.org/10.1137/..
 
?
15

On the Kőnig‐Egerváry theorem for ‐paths:

Bessy, Stéphane ; Ochem, Pascal ; Rautenbach, Dieter
Journal of Graph Theory.  91 (2018)  1 - p. 73-87 , 2018
Link: https://doi.org/10.1002/..
 
1-15