Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID"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)
a service of 
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.
last updated on 2020-08-12 10:35 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
