位置：成果数据库 > 期刊 > 期刊详情页
两类Mycielski′s图的邻强边染色
  • 期刊名称：浙江师范大学学报(自然科学版)29(1): 32-36,2005
  • 时间：0
  • 相关项目：组合结构中几类参数的研究
作者： 戴韵,卜月华
同期刊论文项目
组合结构中几类参数的研究
期刊论文 61
同项目期刊论文
Planar graphs without 4,6 and
Δ(G)=9且不含4-圈的平面图的全
The adjoints of DNA graphs
A note on the 3-choosable plan
The Ramsey numbers R(Tn,W6) fo
New upper bound formulas with
Entire chromatic number and De
On the sizes of graphs embedda
The 2-dipath chromatic number
Edge-partitions of graphs of n
Three-coloring planar graphs w
Coloring the square of an oute
Edge choosability of planar gr
L(p,q)-labeling of K4-minor fr
Planar graphs that have no sho
Edge-face chromatic number of
List coloring Halin graphs
图的点强全染色
几类特殊图的邻点可区别全染色
最大度为5且不含有4-圈的平面图
Total chromatic number of plan
The L(2,1)-labelling of trees
On 3-colorable planar graphs w
On total chromatic number of p
Upper bound of the third edge-
Some bounds on the profile of
Estimate the distance of genom
Two-dimensional bandwidth of g
The Ramsey number of paths ver
某些图论问题的进展
The relationship between BS(H)
Relations among some parameter
两类Mycielski图及一些平面图的
图带宽和与其对偶超图带宽和的关
图的圈带宽和
图P_n∨K_(m,n)的均匀全色数
A sufficient condition for a p
(2,1)-Total labeling of outerp
Bordeaux 3-coloring Conjecture
On the equitable total colorin
平面图平方的最小度
Acyclic 5-choosability of plan
Acyclic 4-choosability of plan
Optimization problems of the t
Chromatic-choosable 4-regular
两类积图的(2,1)-全标号
不含4-圈平面图的线性2-荫度
A note on Ramsey numbers with
The Ramsey numbers of trees ve
Extremal Cut-width Problem for Graphs
色数等于选择数的4-正则图
K4-minor-free图的线性2-荫度
两类Mycielski′s图的邻强边染色和邻点可区别全染色
第一类平面图的一个充分条件
Halin图的线性2-荫度
不含4-圈的平面图的线性2-荫度
图Pn V km,n的均匀全色数