三正则图的列表线性荫度(英文)

范勤亮

您当前的位置：

首页 >

文章列表页 >

三正则图的列表线性荫度(英文)

更新时间：2026-01-21

- 三正则图的列表线性荫度(英文)
- Journal of Xinjiang University (Natural Science Edition in Chinese and English) Vol. 26, Issue 3, Pages: 284-289(2009)
- 作者机构：
  
  新疆大学数学与系统科学学院
- 作者简介：
- 基金信息：
- DOI：
  CLC： O157.5
- Published：2009
- 稿件说明：
移动端阅览
[1]范勤亮.三正则图的列表线性荫度(英文)[J].新疆大学学报(自然科学版),2009,26(03):284-289.

范勤亮. 三正则图的列表线性荫度(英文)[J]. Journal of Xinjiang University (Natural Science Edition in Chinese and English), 2009, 26(3): 284-289.
[1]范勤亮.三正则图的列表线性荫度(英文)[J].新疆大学学报(自然科学版),2009,26(03):284-289. DOI：

范勤亮. 三正则图的列表线性荫度(英文)[J]. Journal of Xinjiang University (Natural Science Edition in Chinese and English), 2009, 26(3): 284-289. DOI：

摘要

图G的线性荫度la(G)为图G的边的最小划分数使得每个划分是一个线性森林.研究了安和吴两人引进的图G的列表线性荫度lla(G)的概念及猜想(?).证明了对任意三正则图G有la(G)=lla(G)=2.

Abstract

The linear arboricity la(G) of a graph G is the minimum number of linear forests which partition the edges of G.An and Wu introduced the notion of list linear aboricity lla(G) of a graph G and conjectured that‘△(G)/2'≤la(G)=lla(G)≤‘△(G)+1/2' for any graph G.In this paper

we prove that la(G) = lla(G) =2 for any cubic graph G.

关键词

Keywords

references

Bondy J A,Murty U S R.Graph Theory with Applications[M].New York:American Elsevier,1976.

Harary F.Covering and packing in graphsⅠ[J].Ann N Y Acad Sci,1970,175:198-205.

Akiyama J,Exoo G,Harary F.Covering and packing in graphsⅢ:Cyclic and acyclic invariants[J].Math Slovaca,1980, 30:405-417.

Wu J L.The linear arboricity of series-parallel graphs[J].Graphs Combin,2000,16:367-372.

Akiyama J,Exoo G,Harary F.Covering and packing in graphsⅣ:Linear arboricity[J].Networks,1981,11:69-72.

Enomoto H,Peroche B.The linear arboricity of some regular graphs[J].J Graph Theory,1984,8:309-324.

Guldan F.The linear arboricity of 10 regular graphs[J].Math Slovaca,1986,36:225-228.

Views

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

No data

Related Author

No data

Related Institution

No data

⁰