Results 91 to 99 of about 280 (99)
Some of the next articles are maybe not open access.
Eulerian and Hamiltonian Dicycles in Directed Hypergraphs
Discrete Mathematics, Algorithms and Applications, 2014Julio Araujo +2 more
exaly
Every 3-Connected, Essentially 11-Connected Line Graph Is Hamiltonian
Journal of Combinatorial Theory Series B, 2006Hong-Jian Lai, Ju Zhou
exaly
On the Complexity of Some Hamiltonian and Eulerian Problems in Edge-Colored Complete Graphs
Lecture Notes in Computer Science, 1991exaly
Eulerian and Hamiltonian Properties of Multidimensional Gaussian Integer Graphs
openaire +1 more source