相关期刊:《Acta Mathematicae Applicatae Sinica》《World Journal of Engineering and Technology》《Acta Mathematica Sinica,English Series》《Wuhan University Journal of Natural Sciences》更多>>
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...
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...
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...