default search action
"Bi-arc graphs and the complexity of list homomorphisms."
Tomás Feder, Pavol Hell, Jing Huang (2003)
- Tomás Feder, Pavol Hell, Jing Huang:
Bi-arc graphs and the complexity of list homomorphisms. J. Graph Theory 42(1): 61-80 (2003)
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.