default search action
"Triangle-free eulerian tours in graphs with maximum degree at most 4."
Tobias Adelgren (1995)
- Tobias Adelgren:
Triangle-free eulerian tours in graphs with maximum degree at most 4. Discret. Math. 138(1-3): 5-14 (1995)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.