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


Eulerian edge sets in locally finite graphs
Authors:Eli Berger  Henning Bruhn
Institution:1. Mathematics Department Faculty of Science, University of Haifa, Mount Carmel, Haifa, 31905, Israel
2. ??quipe Combinatoire et Optimisation Case 189, Universit?? Pierre et Marie Curie, 4 place Jussieu, 75252, Paris Cedex 05, France
Abstract:In a finite graph, an edge set Z is an element of the cycle space if and only if every vertex has even degree in Z. We extend this basic result to the topological cycle space, which allows infinite circuits, of locally finite graphs. In order to do so, it becomes necessary to attribute a parity to the ends of the graph.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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