Problem

By J. Engel, Thank You. 1902

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

1. Gregory Z. Gutin
2. Jørgen Bang-Jensen
3. Thomas Zaslavsky
4. Jose Manuel Camacho Rodriguez
5. Kenneth S. Brown
6. Franco V. Saliola
7. Nathan Reff
8. János Pach

Citations in the corpus

• Digraphs - theory, algorithms and applications (2002, background): “Ádám’s conjecture [1, 2] seems one of the most interesting conjectures on cycles in digraphs.”
• A Mathematical Bibliography of Signed and Gain Graphs and Allied Areas (2018, background): “See Lee, Lucchese, and Chu (1987a). Net signs for the Platonic polyhedra (Table I).”