EDGE-COLORING

作品数：9被引量：1H指数：1
导出分析报告
相关领域：理学更多>>
相关期刊：《Acta Mathematicae Applicatae Sinica》《World Journal of Engineering and Technology》《Acta Mathematica Sinica,English Series》《Wuhan University Journal of Natural Sciences》更多>>
相关基金：国家自然科学基金更多>>
-
在结果中检索

检索结果分析

结果分析中...
选择条件：
  • 期刊=Acta Mathematicae Applicatae Sinicax
共 条 记 录，以下是1-3
全选清除导出
参考文献引证文献引用追踪
视图：
排序：
Conflict-free Connection Number and Independence Number of a Graph被引量：1
《Acta Mathematicae Applicatae Sinica》2021年第2期278-286,共9页Jing WANG Meng JI 
supported by Hunan Education Department Foundation(No.18A382)。
An edge-colored graph G is conflict-free connected if any two of its vertices are connected by a path,which contains a color used on exactly one of its edges.The conflict-free connection number of a connected graph G,...
关键词：EDGE-COLORING conflict-free connection number independence number TREE 
A Note on the Strong Edge-coloring of Outerplanar Graphs with Maximum Degree 3
《Acta Mathematicae Applicatae Sinica》2016年第4期883-890,共8页Shun-yi LIU He-ping ZHANG Hong-liang LU Yu-qing LIN 
Supported by the National Natural Science Foundation of China under Grant No.11501050;the Fundamental Research Funds for the Central Universities under Grant No.310812151003
A strong k-edge-coloring of a graph G is an assignment of k colors to the edges of G in such a way that any two edges meeting at a common vertex, or being adjacent to the same edge of G, axe assigned different colors....
关键词：strong edge-coloring strong chromatic index outerplanar graphs 
BOUNDS ON THE LOWER SIZE OF A 7-CRITICAL GRAPH
《Acta Mathematicae Applicatae Sinica》1994年第4期411-413,141+415-418,共8页刘焕平 张忠辅 沈德安 
In this paper, the authors have obtained some lower bounds on the size of a 7-critical graph,and some results about the planar graph conjecture have been given.
关键词：EDGE-COLORING chromatic index Δ-critical graph planar conjecture 
全选清除导出
共1页<1>
检索报告 对象比较 聚类工具 使用帮助 返回顶部