지원사업
학술연구/단체지원/교육 등 연구자 활동을 지속하도록 DBpia가 지원하고 있어요.
커뮤니티
연구자들이 자신의 연구와 전문성을 널리 알리고, 새로운 협력의 기회를 만들 수 있는 네트워킹 공간이에요.
초록· 키워드
오류제보하기
Let G be a planar graph with maximum degree Δ. The linear 2-arboricity $la_2$(G) of G is the least integer k such that G can be partitioned into k edge-disjoint forests, whose component trees are paths of length at most 2. In this paper, we prove that (1) $la_2(G){\leq}{\lceil}\frac{\Delta}{2}\rceil+8$ if G has no adjacent 3-cycles; (2) $la_2(G){\leq}{\lceil}\frac{\Delta}{2}\rceil+10$ if G has no adjacent 4-cycles; (3) $la_2(G){\leq}{\lceil}\frac{\Delta}{2}\rceil+6$ if any 3-cycle is not adjacent to a 4-cycle of G.
목차
등록된 정보가 없습니다.
참고문헌 (12)
참고문헌 신청
B. Jackson / 1996 / On linear k-arboricity of cubic graphs / Discrete Math 162 (1) : 293 ~ 297
B. L. Chen / 1991 / Decomposing graphs into forests of paths with size less than three / Australas. J. Combin 3 : 55 ~ 73
C. Thomassen / 1999 / Two-coloring the edges of a cubic graph such that each monochromatic component is a path of length at most 5 / J. Combin. Theory Ser. B 75 (1) : 100 ~
G. J. Chang / 1999 / Algorithmic aspects of linear k-arboricity / Taiwanese J. Math 3 (1) : 73 ~ 81
G. J. Chang / 2000 / Linear k-arboricity on trees / Discrete Appl. Math 103 (1) : 281 ~ 287
B. L. Chen / 1991 / Decomposing graphs into forests of paths with size less than three / Australas. J. Combin 3 : 55 ~ 73
C. Thomassen / 1999 / Two-coloring the edges of a cubic graph such that each monochromatic component is a path of length at most 5 / J. Combin. Theory Ser. B 75 (1) : 100 ~
G. J. Chang / 1999 / Algorithmic aspects of linear k-arboricity / Taiwanese J. Math 3 (1) : 73 ~ 81
G. J. Chang / 2000 / Linear k-arboricity on trees / Discrete Appl. Math 103 (1) : 281 ~ 287
이 논문의 저자 정보
최근 본 자료
댓글(0)
0