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


Generating all cycles, chordless cycles, and Hamiltonian cycles with the principle of exclusion
Authors:Marcel Wild  
Institution:aDepartment of Mathematical Sciences, University of Stellenbosch, Van der Ster Gebou, kamer 2023, 7602 Stellenbosch, South Africa
Abstract:An efficient method to generate all edge sets Xsubset of or equal toE of a graph G=(V,E), which are vertex-disjoint unions of cycles, is presented. It can be tweaked to generate (i) all cycles, (ii) all cycles of cardinality less-than-or-equals, slant5, (iii) all chordless cycles, (iv) all Hamiltonian cycles.
Keywords:Generating all Hamiltonian cycles  Generating all cycles  Generating all chordless cycles
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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