首页 | 本学科首页   官方微博 | 高级检索  
     


Crossing matchings and circuits have maximal length
Authors:Yaakov S. Kupitz  Hagit Last  Horst Martini  Micha A. Perles  Rom Pinchasi
Affiliation:1. Institute of Mathematics, The Hebrew University of Jerusalem, Jerusalem, Israel;2. Department of Mathematics, Azrieli College of Engineering, Jerusalem, Israel;3. Fakultät für Mathematik, Technische Universität Chemnitz, Chemnitz, Germany;4. Mathematics Department, Technion—Israel Institute of Technology, Haifa, Israel
Abstract:
Keywords:asterisk  crossing matching  geometric graphs  length  perfect matching
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号