位置：成果数据库 > 期刊 > 期刊详情页
A note on edge-cover coloring of nearly bipartite graphs
  • 期刊名称：Ars Combinatoria
  • 时间：0
  • 页码：423-427
  • 语言：英文
  • 相关项目：关于图的限制染色若干问题研究
作者： Changqing Xu|Yanbin Jia|
同期刊论文项目
关于图的限制染色若干问题研究
期刊论文 19 会议论文 5
同项目期刊论文
Ohba's conjecture is true for graphs with independence number at most three
新型公交网络模型与最优出行路径算法
On super f-edge cover-coloring in multigraphs
[r,s,t]-Coloring of Kn,n
On f-edge cover chromatic index of multigraphs
Minimum genera of certain types of graphs
On uniquely 4-list colorable complete multipartite graphs
On choosability of complete multipartite graphs
Genus polynomials for three types of graphs
图的无圈染色
[1, 1, 2]-COLORINGS OF K5 AND K6
A note on path kernels and partitions
The Edge Cover Chromatic Index of Complete Tripartite Graphs
新型公交网络模型与最优线路选择算法
Nearly antipodal chromatic number of even paths
完全五部图Kn,n,n,n,n（n≡1，5（mod6））的竞争数
K1,m□K1,n的均匀染色
On f-edge Cover Chromatic Index of Multigraphs