The following pages link to Stéphane Bessy (Q345070):
Displayed 16 items.
- Girth, minimum degree, independence, and broadcast independence (Q5242945) (← links)
- Cycle Transversals in Tournaments with Few Vertex Disjoint Cycles (Q5265333) (← links)
- On the Kőnig‐Egerváry theorem for ‐paths (Q5379839) (← links)
- Disjoint 3‐Cycles in Tournaments: A Proof of The Bermond–Thomassen Conjecture for Tournaments (Q5417823) (← links)
- Integer Programming and Combinatorial Optimization (Q5712448) (← links)
- Width Parameterizations for Knot-Free Vertex Deletion on Digraphs. (Q5875534) (← links)
- Good orientations of unions of edge‐disjoint spanning trees (Q6055412) (← links)
- Complementary cycles of any length in regular bipartite tournaments (Q6074575) (← links)
- Arc‐disjoint in‐ and out‐branchings in digraphs of independence number at most 2 (Q6081563) (← links)
- FPT algorithms for packing \(k\)-safe spanning rooted sub(di)graphs (Q6153458) (← links)
- (Arc-disjoint) cycle packing in tournament: classical and parameterized complexity (Q6297948) (← links)
- Good orientations of 2T-graphs (Q6316146) (← links)
- Unbalanced spanning subgraphs in edge labeled complete graphs (Q6373249) (← links)
- Sparse vertex cutsets and the maximum degree (Q6433761) (← links)
- Dichromatic number of chordal graphs (Q6453164) (← links)
- Constrained Flows in Networks (Q6453409) (← links)