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》更多>>
相关基金：国家自然科学基金更多>>
-
在结果中检索

检索结果分析

结果分析中...
共 条 记 录，以下是1-9
全选清除导出
参考文献引证文献引用追踪
视图：
排序：
Nonisomorphic Orientable Quadrangular Embeddings and Edge-Colorings of K_(12s+9)
《Wuhan University Journal of Natural Sciences》2024年第6期563-571,共9页LI Zhaoxiang LIU Jiahong 
In this paper,by constructing the current graph of the complete graph K_(12s+9)and a mapping function,we prove that K_(12s+9)(s is an odd number)has at least 6^(2s)×3^(s+3/2) nonisomorphic orientable quadrangular emb...
关键词：quadrangular embedding maximum genus embedding edge-colorings complete graph current graph 
Bounds for the Rainbow Disconnection Numbers of Graphs
《Acta Mathematica Sinica,English Series》2022年第2期384-396,共13页Xu Qing BAI Zhong HUANG Xue Liang LI 
Supported by National Natural Science Foundation of China(Grant No.11871034)。
An edge-cut of an edge-colored connected graph is called a rainbow cut if no two edges in the edge-cut are colored the same.An edge-colored graph is rainbow disconnected if for any two distinct vertices u and v of the...
关键词：EDGE-COLORING EDGE-CONNECTIVITY rainbow disconnection coloring(number) line graph 
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 
Some Class 1 Graphs on gc-colorings
《Acta Mathematica Sinica,English Series》2016年第10期1237-1245,共9页Hua Wen MA Xia ZHANG 
Supported by Shandong Provincial Natural Science Foundation,China(Grant No.ZR2014JL001);the Shandong Province Higher Educational Science and Technology Program(Grant No.J13LI04);the Excellent Young Scholars Research Fund of Shandong Normal University of China
An edge-coloring of a graph G is an coloring of a graph G is an edge-coloring of G such assignment of colors to all the edges of G. A go- that each color appears at each vertex at least g（v） times. The maximum integ...
关键词：EDGE-COLORING go-coloring go-chromatic index edge covering classification problem 
Cost Edge-Coloring of a Cactus
《World Journal of Engineering and Technology》2015年第3期119-134,共16页Zhiqian Ye Yiming Li Huiqiang Lu Xiao Zhou 
Let C be a set of colors, and let ?be an integer cost assigned to a color c in C. An edge-coloring of a graph ?is assigning a color in C to each edge ?so that any two edges having end-vertex in common have different c...
关键词：CACTUS COST EDGE-COLORING Minimum COST MAXIMUM FLOW PROBLEM 
Note on 2-edge-colorings of complete graphs with small monochromatic k-connected subgraphs
《Applied Mathematics(A Journal of Chinese Universities)》2014年第2期249-252,共4页JIN Ze-min WANG Yu-ling WEN Shi-li 
Supported by the National Natural Science Foundation of China(10701065 and 11101378);Zhejiang Provincial Natural Science Foundation(LY14A010009)
Bollobas and Gyarfas conjectured that for n 〉 4（k - 1） every 2-edge-coloring of Kn contains a monochromatic k-connected subgraph with at least n - 2k ＋ 2 vertices. Liu, et al. proved that the conjecture holds when...
关键词：monochromatic subgraph k-connected subgraph 2-edge-coloring. 
f-Colorings of Some Graphs of f-Class 1
《Acta Mathematica Sinica,English Series》2008年第5期743-748,共6页Xia ZHANG Gui Zhen LIU 
NSFC (10471078,60673047);RSDP (20040422004);NSF of Hebei(A2007000002) of China
An f-coloring of a graph G is an edge-coloring of G such that each color appears at each vertex v V（G） at most f（v） times. The minimum number of colors needed to f-color G is called the f-chromatic index of G and...
关键词：simple graph EDGE-COLORING f-coloring classification of graphs f-chromatic index 
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>
检索报告 对象比较 聚类工具 使用帮助 返回顶部