图中点不交的4-圈
Vertex Disjoint Quadrilaterals in Graph
DOI: 10.12677/AAM.2016.53049, PDF, HTML, XML, 下载: 1,901  浏览: 3,601  国家自然科学基金支持
作者: 衣晓宁, 颜谨：山东大学数学学院，山东 济南
关键词: 点不交；圈；4-圈；Vertex-Disjoint； Cycle； Quadrilaterals
摘要: 令G是一个顶点数为n的图，满足 ，k是任意正整数。假设 ，则图G包含k个独立的4-圈。
Abstract: Let G be a graph of order n with , where k is a positive integer. Suppose that , then G contains k independent quadrilaterals.
文章引用：衣晓宁, 颜谨. 图中点不交的4-圈[J]. 应用数学进展, 2016, 5(3): 399-405. http://dx.doi.org/10.12677/AAM.2016.53049

参考文献

[1] Corrádi, K. and Hajnal, A. (1963) On the Maximal Number of Independent Circuits in a Graph. Acta Mathematica Academiae Scien-tiarum Hungarica, 14, 423-439.
http://dx.doi.org/10.1007/BF01895727
[2] Wang, H. (2004) Vertex-Disjoint Quadrilaterals in Graphs. Discrete Mathematics, 288, 149-166.
http://dx.doi.org/10.1016/j.disc.2004.02.020
[3] Randerath, B., Schiermeyer, I. and Wang, H. (1999) On Quadrilaterals in a Graph. Discrete Mathematics, 203, 229- 237.
[4] El-Zahar, M.H. (1984) On Circuits in Graphs. Discrete Mathematics, 50, 227-230.
http://dx.doi.org/10.1016/0012-365x(84)90050-5
[5] Yan, J. and Liu, G.Z. (2003) Quadrilaterals and Paths of Order 4 in Graph. Acts Mathematics Scientific Ser. A, 23, 711- 718.
[6] Bondy, J.A. and Murty, U.S.R. (1976) Graph Theory with Applications. North-Holland, Amsterdam.
http://dx.doi.org/10.1007/978-1-349-03521-2

为你推荐