AAM  >> Vol. 6 No. 2 (March 2017)

    Disjoint Subgraphs with Specified Properties in Graphs

  • 全文下载: PDF(441KB) HTML   XML   PP.139-145   DOI: 10.12677/AAM.2017.62016  
  • 下载量: 670  浏览量: 4,427   国家自然科学基金支持


王怡华,衣晓宁:山东大学数学学院,山东 济南;
李硕:昌吉学院数学系,新疆 昌吉

点不交4-团弦圈Vertex-Disjoint 4-Cliques Chordal Cycle



Let G be a graph of order n with n≥4k, where k is a positive integer. Suppose that , then the partition of G can be k-1 vertex disjoint 4-cliques and a chordal cycle, where the degree of vertexes in this chordal cycle is equal or greater than 3 or 4.

王怡华, 李硕, 衣晓宁. 图中具有指定性质的不交子图[J]. 应用数学进展, 2017, 6(2): 139-145. https://doi.org/10.12677/AAM.2017.62016


[1] Erdös, P. (1967) Extremal Problems in Graph Theory. In: Harary, F., Ed., A Seminar in Graph Theory, Holt, Rinehart and Winston, 54-56.
[2] Bollobás, B. (2004) Extremal Graph Theory. Courier Corporation.
[3] Corradi, K. and Hajnal, A. (1963) On the Maximal Number of Independent Circuits in a Graph. Acta Mathematica Hungarica, 14, 423-439.
[4] Wang, H. Covering a Graph with Cycles of Lengths at Least 4.
[5] Ore, O. (1960) Note on Hamilton Circuits. The American Mathematical Monthly, 67, 55.
[6] Chartrand, G., Lesniak, L. and Zhang, P. (2010) Graphs & Digraphs. CRC Press.