6-圈至多含一弦平面图的线性荫度

doi:10.15960/j.cnki.issn.1007-6093.2019.02.011

Abstract

CLC Number:

O157.5

LUO Zhaoyang, SUN Lin. The linear aboricity of planar graphs with 6-cycles containing at most one chord[J]. Operations Research Transactions, 2019, 23(2): 113-119.

References 20

[1]	Bondy J A, Murty U S R. Graphs Theory with Applications[M]. London:Macmillan Press Ltd, 1979.
[2]	Akiyama J, Exoo G, Harary F. Covering and packing in graphs Ⅲ:cyclic and acyclic invariants[J]. Mathematica Slovaca, 1980, 30:405-417.
[3]	Péroche B. Complexity of the linear arboricity of a graph[J]. RAIRO Operations Research, 1982, 16:125-129.
[4]	Enomoto H, Péroche B. The linear arboricity of some regular graphs[J]. Journal of Graph Theory, 1984, 8:309-324.
[5]	Guldan F. The linear arboricity of 10-regular graphs[J]. Mathematica Slovaca, 1986, 36:225- 228.
[6]	Guldan F. Some results on linear arboricity[J]. Journal of Graph Theory, 1986, 10:505-509.
[7]	Wu J L. The linear arboricity of series-parallel graphs[J]. Graphs and Combinatorics, 2000, 16:367-372.
[8]	Wu J L, Liu G Z, Wu Y L. The linear arboricity of composition graphs[J]. Journal of Systems Science and Complexity, 2002, 15:372-375.
[9]	Harary F. Covering and packing in graphs I[J]. Annals New York Academy of Sciences, 1970, 175:198-205.
[10]	Wu J L, Hou J F, Sun X Y. A note on the linear arboricity of planar graphs without 4- cycles[C]//The Eighth International Symposium on Operations Research and Its Applications (ISORA.09), Zhangjiajie:Hunan University, 2009:174-178.
[11]	Chen H Y, Qi J M. The linear arboricity of planar graphs with maximum degree at least 5[J]. Information Processing Letters, 2012, 112:767-771.
[12]	Cygan M, Hou J F, Kowalik L, et al. A planar linear arboricity conjecture[J]. Journal of Graph Theory, 2012, 60:403-425.
[13]	Tan X, Chen H Y, Wu J L. The linear arboricity of planar graphs with maximum degree at least five[J]. Bulletin of the Malaysian Mathematical Sciences Society, 2011, 34:541-552.
[14]	Tan X, Chen H Y, Wu J L. The linear arboricity of planar graphs without 5-cycles and 6-cycles[J]. Ars Combinatoria, 2010, 97A:367-375.
[15]	Wu J L. On the linear arboricity of planar graphs[J]. Journal of Graph Theory, 1999, 31:129-134.
[16]	Wu J L, Wu Y W. The linear arboricity of planar graphs of maximum degree seven is four[J]. Journal of Graph Theory, 2008, 58:210-220.
[17]	Wu J L, Hou J F, Liu G Z. The linear of planar graphs with no short cycles[J]. Theoretical Computer Science, 2007, 381:230-233.
[18]	Wang H J, Liu B, Wu J L. The linear arboricity of planar graphs without chordal short cycles[J]. Utilitas Mathematica, 2012, 87:255-263.
[19]	Chen H Y, Tan X, Wu J L, et al. The linear arboricity of planar graphs without 5-, 6-cycles with chords[J]. Graphs and Combinatorics, 2013, 29:373-385.
[20]	Chen X L, Wu J L. The linear arboricity of planar graphs without 5-cycles with two chords[J]. Filomat, 2016, 30:1134-1142.

The linear aboricity of planar graphs with 6-cycles containing at most one chord

PDF

Knowledge

Abstract

Cite this article

share this article

References 20

Related Articles 15

Recommended Articles

Metrics

Comments

[1]	LIU Yao. On (1, 0)-relaxed strong edge-coloring of graphs [J]. Operations Research Transactions, 2021, 25(2): 115-126.
[2]	BAO Xiaoguang, LU Chao, HUANG Dongmei, YU Wei. Approximation algorithm for min-max cycle cover problem on a mixed graph [J]. Operations Research Transactions, 2021, 25(1): 107-113.
[3]	CHEN Min, YANG Jianmin, ZHANG Hao, WANG Yiting. Weakly entire coloring of outerplanar graphs [J]. Operations Research Transactions, 2021, 25(1): 132-136.
[4]	CHEN Hongling, WANG Huijuan, SUN Fengyan, XUE Juan, GAO Hongwei. Linear arboricity of planar graphs with maximum degree at least seven [J]. Operations Research Transactions, 2020, 24(3): 154-160.
[5]	CHEN Tao. Upper bounds on minimum balanced bipartition of Hamilton plane graphs [J]. Operations Research Transactions, 2020, 24(3): 161-166.
[6]	CHEN Hongyu, TAN Xiang. An upper bound of the linear 2-arboricity of planar graphs with neither 5-cycles nor adjacent 4-cycles [J]. Operations Research Transactions, 2019, 23(1): 104-110.
[7]	LV Xuezheng, WEI Erling, SONG Hongye. The basis number of join graphs [J]. Operations Research Transactions, 2018, 22(4): 148-152.
[8]	ZHANG Xin, LIU Weichan. The coloring of the class of 1-planar graphs and its subclasses [J]. Operations Research Transactions, 2017, 21(4): 135-152.
[9]	SU Zhenhua. The crossing number of the join product of C_6+3K_2 with P_n and C_n [J]. Operations Research Transactions, 2017, 21(3): 23-34.
[10]	ZHOU Zhidong, LI Long. On the crossing numbers of join of the special graph on six vertices with nK_1, P_n or C_n [J]. Operations Research Transactions, 2016, 20(4): 115-126.
[11]	SUN Lin, LUO Zhaoyang. Edge colourings of embedded special graphs [J]. Operations Research Transactions, 2015, 19(1): 125-130.
[12]	DING Lushun, WANG Guanghui, YAN Jin. The properly colored paths and cycles for the triangle-free graphs [J]. Operations Research Transactions, 2014, 18(3): 116-120.
[13]	YU Guidong, ZHANG Chao, GONG Qijuan. Energy and Hamiltonicity of graphs [J]. Operations Research Transactions, 2014, 18(2): 40-48.
[14]	YE Yongsheng, LIU Fang, ZHAI Mingqing. Pebbling numbers of middle graphs of cycles and Graham's conjecture [J]. Operations Research Transactions, 2013, 17(3): 35-44.
[15]	WANG Guang-Hui, ZHOU Shan. Properly Colored Paths and Cycles in Complete Graphs [J]. Operations Research Transactions, 2011, 15(3): 51-56.