二部图中过特定点的点不交弦圈
Vertex-Disjoint Chorded Cycles through Specified Vertices in Bipartite Graphs
DOI: 10.12677/AAM.2018.74051, PDF,    国家自然科学基金支持
作者: 蔺逍遥, 高云澍 ：宁夏大学数学统计学院，宁夏 银川
关键词: 点不交弦圈；二部图；最小度 ；Vertex-Disjoint Chorded Cycles； Bipartite Graphs； Minimum Degree
摘要: 弦是指连接圈上的两个点构成的一条边，使得这条边不属于圈上。如果一个圈至少有一条弦，那么我们称这个圈为弦圈。本文给出了二部图中过含特定点集点不交弦圈的最小度条件。
Abstract: A chord is an edge between two vertices of a cycle that is not an edge on the cycle. If a cycle has at least one chord, then the cycle is called a chorded cycle. The minimum degree condition is given for a bipartite graph to contain vertex-disjoint chorded cycles containing specified vertices.
文章引用：蔺逍遥, 高云澍. 二部图中过特定点的点不交弦圈 [J]. 应用数学进展, 2018, 7(4): 413-417. https://doi.org/10.12677/AAM.2018.74051

参考文献

[1] Bondy, J.A. and Murty, U.S.R. (1976) Graph Theory with Applications. Elsevier, New York. [Google Scholar] [CrossRef] 
[2] Dirac, G.A. (1952) Some Theorems on Abstract Graphs. Proceedings of the London Mathematical Society, 2, 69-81. [Google Scholar] [CrossRef] 
[3] Moon, J.W. and Moser, L. (1963) On Hamiltonian Bipartite Graphs. Israel Journal of Mathematics, 1, 163-165. [Google Scholar] [CrossRef] 
[4] Entringer, R.C. and Schmeichel, E.F. (1988) Edge Conditions and Cycle Structure in Bipancyclic Graphs. Ars Combinatoria, 26, 229-232.
[5] Schmeichel, E.F. and Mitchem, J. (1982) Bipartite Graphs with Cycles of All Even Lengths. Journal of Graph Theory, 6, 429-439. [Google Scholar] [CrossRef] 
[6] Li, H. (2013) Generalizations of Dirac’s Theorem in Hamiltonian Graph Theory—A Survey. Discrete Mathematics, 313, 2034-2053. [Google Scholar] [CrossRef] 
[7] Cream, M., Faudree, R., Gould, R. and Hirohata, K. (2016) Chorded Cycles. Graphs and Combinatorics, 32, 2296-2313. [Google Scholar] [CrossRef] 

为你推荐