Research problems (Q5903899)
From MaRDI portal
scientific article; zbMATH DE number 4091554
Language | Label | Description | Also known as |
---|---|---|---|
English | Research problems |
scientific article; zbMATH DE number 4091554 |
Statements
Research problems (English)
0 references
1988
0 references
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.
0 references
Problems
0 references