default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID"Matching preclusion for k-ary n-cubes with odd k ≥ 3."
Xiaomin Hu et al. (2017)
- Xiaomin Hu, Bin Zhao, Yingzhi Tian, Jixiang Meng:
Matching preclusion for k-ary n-cubes with odd k ≥ 3. Discret. Appl. Math. 229: 90-100 (2017)
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-02-20 15:46 CET 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:
