default search action
"Every 2-choosable graph is (2m, m)-choosable."
Zsolt Tuza, Margit Voigt (1996)
- Zsolt Tuza, Margit Voigt:
Every 2-choosable graph is (2m, m)-choosable. J. Graph Theory 22(3): 245-252 (1996)
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.