default search action
"The complexity of pebbling reachability and solvability in planar and ..."
Timothy Lewis, Charles A. Cusack, Lisa Dion (2014)
- Timothy Lewis, Charles A. Cusack, Lisa Dion:
The complexity of pebbling reachability and solvability in planar and outerplanar graphs. Discret. Appl. Math. 172: 62-74 (2014)
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.