default search action
"Every N2-Locally Connected claw-Free Graph with Minimum Degree ..."
Erling Wei et al. (2011)
- Erling Wei, Ye Chen, Ping Li, Hong-Jian Lai:
Every N2-Locally Connected claw-Free Graph with Minimum Degree at Least 7 is Z3-Connected. Discret. Math. Algorithms Appl. 3(2): 193-202 (2011)
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.