The following pages link to Stéphane Bessy (Q345070):
Displaying 50 items.
- Antistrong digraphs (Q345072) (← links)
- Polynomial kernels for proper interval completion and related problems (Q393083) (← links)
- Exponential domination in subcubic graphs (Q504979) (← links)
- Colorful paths for 3-chromatic graphs (Q512581) (← links)
- Polynomial kernels for 3-leaf power graph modification problems (Q602747) (← links)
- Kernels for feedback arc set in tournaments (Q657916) (← links)
- Bounds on the exponential domination number (Q729783) (← links)
- Graphs with the second and third maximum Wiener indices over the 2-vertex connected graphs (Q777380) (← links)
- (Q941335) (redirect page) (← links)
- Paths partition with prescribed beginnings in digraphs: A Chvátal-Erdős condition approach (Q941336) (← links)
- Spannning a strong digraph by \(\alpha\) circuits: a proof of Gallai's conjecture (Q949757) (← links)
- Two proofs of the Bermond-Thomassen conjecture for tournaments with bounded minimum in-degree (Q960967) (← links)
- Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture (Q965246) (← links)
- Every strong digraph has a spanning strong subgraph with at most \(n+2\alpha-2\) arcs (Q1405121) (← links)
- Bounds on the burning number (Q1682876) (← links)
- Complementary cycles in regular bipartite tournaments: a proof of Manoussakis, Song and Zhang conjecture (Q1689895) (← links)
- Out-degree reducing partitions of digraphs (Q1704574) (← links)
- Dynamic monopolies for interval graphs with bounded thresholds (Q1741518) (← links)
- Enumerating the edge-colourings and total colourings of a regular graph (Q1956248) (← links)
- Exponential independence in subcubic graphs (Q2032859) (← links)
- Complexity of some arc-partition problems for digraphs (Q2079880) (← links)
- Non-separating spanning trees and out-branchings in digraphs of independence number 2 (Q2102758) (← links)
- Algorithmic aspects of broadcast independence (Q2127617) (← links)
- Factorially many maximum matchings close to the Erdős-Gallai bound (Q2152791) (← links)
- On independent set in \(B_1\)-EPG graphs (Q2174555) (← links)
- Maximal Wiener index for graphs with prescribed number of blocks (Q2180710) (← links)
- Parameterized complexity of a coupled-task scheduling problem (Q2283295) (← links)
- The structure of graphs with given number of blocks and the maximum Wiener index (Q2292137) (← links)
- Relating broadcast independence and independence (Q2329172) (← links)
- Extremal values of the chromatic number for a given degree sequence (Q2409517) (← links)
- Burning a graph is hard (Q2410223) (← links)
- The geodetic hull number is hard for chordal graphs (Q2413187) (← links)
- Degree-constrained 2-partitions of graphs (Q2419120) (← links)
- (Arc-)disjoint flows in networks (Q2437760) (← links)
- The categorical product of two 5-chromatic digraphs can be 3-chromatic (Q2581426) (← links)
- Packing arc-disjoint cycles in tournaments (Q2663711) (← links)
- Unbalanced spanning subgraphs in edge labeled complete graphs (Q2692172) (← links)
- On Independent Set on B1-EPG Graphs (Q2788999) (← links)
- Kernels for Feedback Arc Set In Tournaments (Q2920111) (← links)
- Two-floor buildings need eight colors (Q2940593) (← links)
- Optical index of fault tolerant routings in WDM networks (Q3057172) (← links)
- Polynomial Kernels for Proper Interval Completion and Related Problems (Q3088286) (← links)
- Arc-chromatic number of digraphs in which every vertex has bounded outdegree or bounded indegree (Q3418196) (← links)
- Two proofs of Bermond-Thomassen conjecture for regular tournaments (Q3439564) (← links)
- Polynomial Kernels for 3-Leaf Power Graph Modification Problems (Q3651535) (← links)
- The Geodetic Hull Number is Hard for Chordal Graphs (Q4604645) (← links)
- Packing Arc-Disjoint Cycles in Tournaments (Q5092386) (← links)
- Out‐colourings of digraphs (Q5110646) (← links)
- Triangle packing in (sparse) tournaments: approximation and kernelization (Q5111699) (← links)
- Bipartite spanning sub(di)graphs induced by 2‐partitions (Q5241609) (← links)