default search action
"Characterizing minimally n-extendable bipartite graphs."
Dingjun Lou (2008)
- Dingjun Lou:
Characterizing minimally n-extendable bipartite graphs. Discret. Math. 308(11): 2269-2272 (2008)
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.