Research problems (Q5903899)

J.-C. Bermond poses two problems and formulates following conjectures: Problem 97: Conjecture: If G has a Hamiltonian decomposition, then its line graph can be decomposed into Hamilton cycles. Problem 98: Conjecture: The minimum number of directed cycles needed to cover the vertices of a strong digraph G is less than or equal to the independence number of G.