default search action
"Acyclic 3-choosability of sparse graphs with girth at least 7."
Oleg V. Borodin et al. (2010)
- Oleg V. Borodin, Min Chen, Anna O. Ivanova, André Raspaud:
Acyclic 3-choosability of sparse graphs with girth at least 7. Discret. Math. 310(17-18): 2426-2434 (2010)
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.