The server is under maintenance between 08:00 to 12:00 (GMT+08:00), and please visit later.
We apologize for any inconvenience caused
Login  | Sign Up  |  Oriprobe Inc. Feed
China/Asia On Demand
Journal Articles
Laws/Policies/Regulations
Companies/Products
Adjacent Strong Edge Colorly and Aadjacent-vertex-distinguishing-total Coloring of the Mycielski Graph of P2n
Author(s): 
Pages: 4-6
Year: Issue:  1
Journal: GUANGXI SCIENCES

Keyword:  图论邻强边色数邻点可区别全色数Mycielski图;
Abstract: 定义新图P2n,并在n≥3时,确定P2n的Mycielski图的邻强边色数和邻点可区别全色数,构造一个M(P2n)的邻点可区别全染色法.
Related Articles
No related articles found