| 图的边覆盖染色中的分类问题(英文) |
| |
| 引用本文： | 苗莲英,逄世友.图的边覆盖染色中的分类问题(英文)[J].数学杂志,2001,21(4). |
| |
| 作者姓名： | 苗莲英 逄世友 |
| |
| 作者单位： | 1. 山东大学数学系,
2. 山东农业大学理学院, |
| |
| 基金项目： | the National Natural Science Foundation and the Doctoral Foundationof the Education Committee of P.R.China |
| |
| 摘 要： | 设 G是一个图 ,其边集是 E( G) ,E( G)的一个子集 S称为 G的一个边覆盖 ,若 G的每一点都是 S中一条边的端点 .G的一个 (正常 )边覆盖染色是对 G的边进行染色 ,使得每一色组都是 G的一个边覆盖 ,使 G有 (正常 )边覆盖染色所需最多颜色数 ,称为 G的边覆盖色数 ,用χ′c( G)表示 .已知的结果是对于任意简单图 G,都有 δ- 1≤ χ′c( G)≤ δ,δ是 G的最小度 .若 χ′c( G) =δ,则称 G是 CI类的 ;否则称为 CII类的 .本文主要研究了平面图及平衡的完全 r分图的分类问题
|
| 关 键 词： | 边覆盖染色 CI类图 CII类图 平衡的完全r分图 |
THE CLASSIFICATION OF GRAPHS ON EDGE COVERING COLORING |
| |
| MIAO Lian-ying,PANY Shi-you.THE CLASSIFICATION OF GRAPHS ON EDGE COVERING COLORING[J].Journal of Mathematics,2001,21(4). |
| |
| Authors: | MIAO Lian-ying PANY Shi-you |
| |
| Abstract: | Let G be a graph with edge set E(G),S E(G) is called a edge cover of G if every vertex of G is an end vertex of an edge in S. The edge covering chromatic number of a graph G, denoted by χ′c(G), is the maximum size of a partition of E(G) into edge covers of G. It is known that for any graph G with minimum degree δ,δ-1≤X′c(G)≤δ. We say that G is of CI if χ′c(G)=δ, and that G is of CII if χ′c(G) =δ-1 for any graph G. Thus we can classify graphs into two types depending on the value of their edge covering chromatic numbers. In this paper,we consider the classification of planar graphs and balanced complete r-partite graphs. |
| |
| Keywords: | edge covering coloring graphs of CI graphs of CII balanced complete r partite graph |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
