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


Hamilton cycles in line graphs of 3-hypergraphs
Institution:Department of Mathematics and European Centre of Excellence NTIS (New Technologies for the Information Society), University of West Bohemia, Pilsen, Czech Republic
Abstract:We prove that every 52-connected line graph of a rank 3 hypergraph is Hamiltonian. This is the first result of this type for hypergraphs of bounded rank other than ordinary graphs.
Keywords:Hamilton cycle  Line graph  3-hypergraph
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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