141 results on '"Frédéric Havet"'
Search Results
2. On the Minimum Number of Arcs in \(\boldsymbol{k}\)-Dicritical Oriented Graphs.
3. Semi-proper orientations of dense graphs.
4. On the Minimum Number of Arcs in 4-Dicritical Oriented Graphs.
5. Diameter of the inversion graph.
6. Minimum acyclic number and maximum dichromatic number of oriented triangle-free graphs of a given order.
7. Spanning eulerian subdigraphs in semicomplete digraphs.
8. On Finding the Best and Worst Orientations for the Metric Dimension.
9. Grabbing Olives on Linear Pizzas and Pissaladières.
10. Digraph redicolouring.
11. Low chromatic spanning sub(di)graphs with prescribed degree or connectivity properties.
12. Arc-disjoint in- and out-branchings in digraphs of independence number at most 2.
13. Overlaying a hypergraph with a graph with bounded maximum degree.
14. On the Nash number and the diminishing Grundy number of a graph.
15. On the minimum number of inversions to make a digraph k-(arc-)strong.
16. On the minimum number of arcs in 4-dicritical oriented graphs.
17. Dichromatic number of chordal graphs.
18. Digraph redicolouring.
19. Overlaying a Hypergraph with a Graph with Bounded Maximum Degree.
20. Inversion number of an oriented graph and related parameters.
21. On the semi-proper orientations of graphs.
22. Powers of paths in tournaments.
23. On the unavoidability of oriented trees.
24. Problems, proofs, and disproofs on the inversion number.
25. On the minimum number of arcs in k-dicritical oriented graphs.
26. On the Dichromatic Number of Surfaces.
27. A variant of the Erdős-Sós conjecture.
28. On the dichromatic number of surfaces.
29. On the inversion number of oriented graphs.
30. On the inversion number of oriented graphs.
31. On the Unavoidability of Oriented Trees.
32. Bipartite spanning sub(di)graphs induced by 2-partitions.
33. Complexity Dichotomies for the Minimum ℱ -Overlay Problem.
34. Finding a subdivision of a prescribed digraph of order 4.
35. Subdivisions of oriented cycles in digraphs with large chromatic number.
36. χ-bounded families of oriented graphs.
37. Minimum density of identifying codes of king grids.
38. Steinberg-like theorems for backbone colouring.
39. Complexity dichotomies for the MinimumF-Overlay problem.
40. On the Complexity of Compressing Two Dimensional Routing Tables with Order.
41. Out-degree reducing partitions of digraphs.
42. Minimum-Density Identifying Codes in Square Grids.
43. Coloring Graphs with Constraints on Connectivity.
44. Identifying codes for infinite triangular grids with a finite number of rows.
45. Bispindle in strongly connected digraphs with large chromatic number.
46. Minimum density of identifying codes of king grids.
47. Spanning eulerian subdigraphs in semicomplete digraphs.
48. Constrained ear decompositions in graphs and digraphs.
49. Backbone colouring and algorithms for TDMA scheduling.
50. Corrigendum to 'Bisimplicial vertices in even-hole-free graphs'.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.