{"title":"A sufficient condition for pre-Hamiltonian cycles in bipartite digraphs","authors":"S. Darbinyan, I. Karapetyan","doi":"10.1109/CSITECHNOL.2017.8312150","DOIUrl":null,"url":null,"abstract":"A cycle in a balanced bipartite digraph is called a pre-Hamiltonian if it contains all the vertices of the balanced bipartite digraph except two. In this paper we give a sufficient condition for the existence of pre-Hamiltonian cycle in a strongly connected balanced bipartite digraph.","PeriodicalId":332371,"journal":{"name":"2017 Computer Science and Information Technologies (CSIT)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 Computer Science and Information Technologies (CSIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSITECHNOL.2017.8312150","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
A cycle in a balanced bipartite digraph is called a pre-Hamiltonian if it contains all the vertices of the balanced bipartite digraph except two. In this paper we give a sufficient condition for the existence of pre-Hamiltonian cycle in a strongly connected balanced bipartite digraph.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
