位置：成果数据库 > 期刊 > 期刊详情页
平面图的k-重（2k＋2）-染色
  • ISSN号：1006-6837
  • 期刊名称：《数学研究》
  • 时间：0
  • 分类：O157[理学—数学;理学—基础数学]
  • 作者机构：[1]浙江师范大学数理与信息工程学院,浙江金华321004
  • 相关基金：supported by the National Natural Science Foundation of China（10971198）.
作者： 吴玉蝶[1], 卜月华[1]
关键词： k-重染色, 平面图, 奇围长, k-fold coloring, Planar graph, Odd girth
中文摘要：

G=（V,E）表示一个顶点集为V,边集为E的有限简单无向图.若存在映射Φ：V（G）→Zk（n）（Zk（n）是由{1,2,…,n}的所有k-元子集构成的集合）,满足：Vuv∈E（G）,有Φ（u）∩Φ（v）=Φ,则称Φ是G的一个k-重n-顶点染色.本文证明了奇围长至少为5k-7（k=4）或5k-9（k=6）的平面图G是k-重（2k＋2）-可染的.

英文摘要：

Let G=（V,E） be a finite,simple and undirected graph with the set of vertices V, and the set of edges E.A k-fold n-coloring of a graph G is a mappingφ：V（G）→Zk（n） （Zk（n） is the collection of all k-subsets of {1.2.…,n} ）,such that：Vuv∈E（G）,there isφ（u）∩φ（v）=φ,then say G is k-fold n-colorable.We show that every planar graph with odd girth at least 5k-7（k=4） or 5k-9（k=6） can be k-fold（2k＋2）-colorable.

同期刊论文项目
关于图染色及相关问题研究
期刊论文 69 会议论文 1
同项目期刊论文
-total-colorability of plane graphs with maximum degree ≥6 with neither chordal 5-cycle nor chord
A sufficient condition for a plane graph with maximum degree 6 to be class 1
Upper bounds on vertex distinguishing chromatic index of some Halin graphs
Equitable and equitable list colorings of graphs
Backbone Colorihg of planar graphs without special circles
平面图的k-重(2k+2)-染色(英文)
UPPER MINUS TOTAL DOMINATION NUMBER OF 6-REGULAR GRAPH
不含短圈的平面图的2-距离染色
The Modified Zagreb Indices of Nanotubes and Dendrimer Nanostars
Acyclic edge coloring of sparse graphs
最大度为7且不含带弦5-圈的平面图是8-全可染的
Planar graphs without cycles of length 4,5,8 or 10 are 3-choosable
Theorems about Zagreb indices and Modified Zagreb indices
The L(p,q)-labeling of planar graphs cycles of length from 4 to 9
On acyclic edge coloring of planar graphs without intersecting triangles
On 3-choosability of triangle-free plane graphs
A structural theorem of planar graphs with some applications
Planar graphs without cycles of length 4,7,8 or 9 are 3-choosable
The L(p,q)-labeling of planar graphs without 4,5,6-cycles
Adjacent Vertex Distinguishing Edge-Colorings of Planar Graphs with Girth at Least Six
Some Results about Modified Zagreb Indices, ARS Combinatoria
EQUITABLE COLORING OF 2-DEGENERATE GRAPH AND PLANE GRAPHS WITHOUT CYCLES OF SPECIFIC LENGTHS
UPPER MINUS TOTAL DOMINATION NUMBER IN K-REGULAR GRAPH
没有5-圈的平面图的BB-染色(英文)
The Connectivity of exchanged hypercubes
Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable
The spanning connectivity of folded hypercubes
Total-colorability of plane graphs with maximum degree at least 6 and without adjacent short cycles
围长至少为５的平面图的 L(p,q)-标号
k-FOLD (2k + 1)-COLORING OF PLANAR GRAPHS
围长至少为６的平面图的L(p,q)-标号
没有4-圈的平面图的BB-染色
Decomposing a planar graph with girth at least 8 into a forest and a matching
The Third Geometric-Arithmetic Index of TUC4C8(S) Nanotube
Plane Graphs with Maximum degree are Entire -Colorable
Improved upper bound for acyclic chromatic index of planar graphs without 4-cycles
The Third Geometric-Arithmetic Index of TUC4C8(S) NANOTORUS
The Application of 3-Colour Theorem and 4-Colour Theorem in the Problem of Repeaters’ Site Sel
PI Index of Extremal Simple Pericondensed Hexagonal systems
The Third Geometric-Arithmetic Index of Nanotubes
Linear coloring of sparse graphs
An optimal square coloring of planar graphs
The Third Geometric-Arithmetic Index of Dendrimer Nanostars
Theorems about PI Indices
最大度至多为６的平面图的 L(2,1)－标号
Prediction of Geographical Criminal's Anchor Point Based on Geographical Criminal's Anchor Point Bas
若干倍图的均匀染色
无4,5,6-圈且无两个相交三角形的平面图的L（p,q）-标号
围长至少为5的平面图的L(p，q)-标号
不含4，5，6-圈的平面图的L(p，q)-标号
不含4-9圈的平面图的L（p,q）-标号
关于最大度为7的平面图全染色的一个注记
三正则图的Upper减控制数
可平面图3可选择的一个充分条件
关于图的强符号控制数的下界
Mycielski图的BBC染色
期刊信息
  • 《数学研究》
  • 主管单位:厦门大学
  • 主办单位:厦门大学数学科学学院 福建省数学会
  • 主编：林群
  • 地址：厦门大学数学系
  • 邮编：361005
  • 邮箱：jmaths@xmu.edu.cn
  • 电话：0592-2580752 21828321
  • 国际标准刊号：ISSN：1006-6837
  • 国内统一刊号：ISSN：35-1177/O1
  • 邮发代号:
  • 获奖情况:
  • 国内外数据库收录:
  • 美国数学评论（网络版）,德国数学文摘
  • 被引量:1284