OnTheAdjacentStrongEdgeColoringsof3-RegularHalinGraphs

您当前的位置：

首页 >

文章列表页 >

工程技术 | 更新时间：2026-01-21

- OnTheAdjacentStrongEdgeColoringsof3-RegularHalinGraphs
- OnTheAdjacentStrongEdgeColoringsof3-RegularHalinGraphs
- 新疆大学学报（自然科学版中英文） 1998年第4期
- 作者机构：
- 作者简介：
- 基金信息：
- DOI：
  中图分类号： O157.5
- 纸质出版：1998
- 稿件说明：
移动端阅览
[1].On The Adjacent Strong Edge Colorings of 3-Regular Halin Graphs[J].新疆大学学报(自然科学版),1998(04).

OnTheAdjacentStrongEdgeColoringsof3-RegularHalinGraphs[J]. Journal of Xinjiang University (Natural Science Edition in Chinese and English), 1998, (4).
[1].On The Adjacent Strong Edge Colorings of 3-Regular Halin Graphs[J].新疆大学学报(自然科学版),1998(04). DOI：

OnTheAdjacentStrongEdgeColoringsof3-RegularHalinGraphs[J]. Journal of Xinjiang University (Natural Science Edition in Chinese and English), 1998, (4). DOI：

１ＩｎｔｒｏｄｕｃｔｉｏｎＴｈｅｃｏｌｏｒｉｎｇｏｆｇｒａｐｈｓｉｓｗｉｄｅｌｙａｐｐｌｉｅｄｉｎｐｒａｃｔｉｃｅ；Ｉｎｓｏｍｅｎｅｔｗｏｒｋｐｒｏｂｌｅｍｃａｎｂｅｃｏｎｖｅｒｔｅｄｔｏｔｈａｔｏｆｓｔｒｏｎｇｅｄｇｅｃｏｌｏｒｉｎｇｏｒａｄｊａｃ...

For graph G(V

a maping f:E→{1

} meeting with the following two conditions:(1) If e 1

e 2∈E and e 1

e 2 is adjacent

then f(e 1)≠f(e 2); (2)if uv∈E

then C(u)≠C(v) where C(u)= {f(u

v)|uv∈E} is called an adjacent strong edge coloring of G

and χ′ as (G)= min |{f(e)|e∈E}| is called the adjacent strong edge chromatic number.In this paper

we study the χ′ as (G) of 3 regular Halin graphs.

浏览量

下载量

CSCD

文章被引用时，请邮件提醒。

提交

工具集

关联资源

暂无数据