43 results on '"Bessy, Stéphane"'
Search Results
2. FPT algorithms for packing k-safe spanning rooted sub(di)graphs
3. Unbalanced Spanning Subgraphs in Edge Labeled Complete Graphs
4. Complementary cycles of any length in regular bipartite tournaments
5. Factorially Many Maximum Matchings Close to the Erdős-Gallai Bound
6. Arc‐disjoint in‐ and out‐branchings in digraphs of independence number at most 2
7. Exponential independence in subcubic graphs
8. Packing Arc-Disjoint Cycles in Tournaments
9. Polynomial Kernels for Proper Interval Completion and Related Problems
10. Polynomial Kernels for 3-Leaf Power Graph Modification Problems
11. Good orientations of unions of edge‐disjoint spanning trees
12. Maximal Wiener index for graphs with prescribed number of blocks
13. Graphs with the second and third maximum Wiener indices over the 2-vertex connected graphs
14. Three Min-Max Theorems Concerning Cyclic Orders of Strong Digraphs
15. The structure of graphs with given number of blocks and the maximum Wiener index
16. Out‐colourings of digraphs
17. Degree-constrained 2-partitions of graphs
18. Dynamic monopolies for interval graphs with bounded thresholds
19. On the Kőnig‐Egerváry theorem for ‐paths
20. Bounds on the burning number
21. The Geodetic Hull Number is Hard for Chordal Graphs
22. Burning a graph is hard
23. The Geodetic Hull Number is Hard for Chordal Graphs
24. Complementary cycles in regular bipartite tournaments: a proof of Manoussakis, Song and Zhang Conjecture
25. Extremal Values of the Chromatic Number for a Given Degree Sequence
26. Colorful paths for 3-chromatic graphs
27. Bounds on the exponential domination number
28. Antistrong digraphs
29. Exponential Domination in Subcubic Graphs
30. Two-floor buildings need eight colors
31. Cycle Transversals in Tournaments with Few Vertex Disjoint Cycles
32. (Arc-)disjoint flows in networks
33. Polynomial kernels for Proper Interval Completion and related problems
34. Disjoint 3‐Cycles in Tournaments: A Proof of The Bermond–Thomassen Conjecture for Tournaments
35. Kernels for feedback arc set in tournaments
36. Polynomial kernels for 3-leaf power graph modification problems
37. Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture
38. Two proofs of the Bermond–Thomassen conjecture for tournaments with bounded minimum in-degree
39. Optical index of fault tolerant routings in WDM networks
40. Spanning a strong digraph by α circuits: A proof of Gallai’s conjecture
41. Two proofs of Bermond-Thomassen conjecture for regular tournaments
42. The categorical product of two 5-chromatic digraphs can be 3-chromatic
43. Every strong digraph has a spanning strong subgraph with at most n+2α−2 arcs
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.