数学与计算机科学 |
|
|
|
|
Cartesian积与邻点可区别着色之间的关系 |
王国兴1,2 |
1. 兰州财经大学 甘肃商务发展研究中心, 甘肃 兰州 730020; 2. 兰州财经大学 信息工程学院, 甘肃 兰州 730020 |
|
Relation between Cartesian product and adjacent vertex distinguishing coloring |
WANG Guoxing1,2 |
1. Gansu Business Development Research Center, Lanzhou University of Finance and Economics, Lanzhou 730020, China; 2. College of Information Engineering, Lanzhou University of Finance and Economics, Lanzhou 730020, China |
[1] BALISTER P N, GYÖRI E, LEHEL J, et al. Adjacent vertex distinguishing edge-colorings[J]. SIAM J Discrete Math,2007,21(1):237-250. [2] BARIL J L, KHEDDOUCI H, TOGNI O. Adjacent vertex distinguishing edge colorings of meshes[J]. Australasian Journal of Combinatorics,2006,35:89-102. [3] GREENHILL C, RUCIИSKI A. Neighbour distinguishing edge colorings of random regular graphs[J]. The Electronic Journal of Combinatorics,2006,13(#R77):1-12. [4] HATAMI H. Δ+300 is a bound on the adjacent vertex distinguishing edge chromatic number[J]. Journal of Combinatorial Theory:Series B,2005,95:246-256. [5] EDWARDS K, HOR AЙÁK M, WO A?G NIAK M. On the neighbour distinguishing index of a graph[J]. Graphs and Combinatorics,2006,22:341-350. [6] ZHANG Z F, LIU L Z, WANG J F. Adjacent strong edge coloring of graphs[J]. Appl Math Lett,2002,15:623-626. [7] ZANG Z F, CHEN X E, LI J W, et al. On adjacent vertex distinguishing total coloring of graphs[J]. Science in China (Ser A):Mathematics,2005,48(3):289-299. [8] CHEN X E. Adjacent-vertex-distinguishing total chromatic numbers on K2n+1-E(P3)[J]. International Journal of Pure and Applied Mathematics,2004,13(1):21-29. [9] CHEN X E. On the adjacent vertex distinguishing total coloring numbers of graphs with Δ=3[J]. Discrete Mathematics,2008,308:4003-4007. [10] CHEN X E, ZHANG Z F. AVDTC numbers of generalized Halin graphs with maximum degree at least 6[J]. Acta Mathematicae Applicatae Sinica:English Series,2008,24(1):55-58. [11] CHEN X E, ZHANG Z F. Adjacent-vertex-distinguishing total chromatic numbers of Pm×Kn[J]. J Mathematical Research and Exposition,2006,26(3):489-494. [12] CHEN X E, ZHANG Z F, SUN Y R. Adjacent-vertex-distinguishing total chromatic numbers on monocycle graphs and the square of cycles[J]. International Journal of Pure and Applied Mathematics,2005,18(4):481-491. [13] CHEN X E, ZHANG Z F, SUN Y R. A note on adjacent-vertex-distinguishing total chromatic numbers for Pm×Pn,Pm×Cn and Cm×Cn[J]. J Mathematical Research and Exposition,2008,28(4):789-798. [14] HULGAN J. Concise proofs for adjacent vertex distinguishing total colorings[J]. Discrete Mathematics,2009,309:2548-2550. [15] SUN Y L, SUN L. The (adjacent) vertex-distinguishing total coloring of the Mycielski graphs and the Cartesian product graphs[C]//7-th China-Japan Conference, Discrete Geometry, Combinatorics and Graph Theory. Heidelberg:Springer-Verlag,2007:200-205. [16] WANG H Y. On the adjacent vertex distinguishing total chromatic numbers of graphs with Δ=3[J]. J Comb Optim,2007,14:87-109. [17] BONDY J A, MURTY U S R. Graph Theory with Applications[M]. New York:Elsevier Science Publishing Co. Inc.,1976. [18] TONG C L, LIN X H, YANG Y S, et al. Equitable total coloring of CmCn[J]. Discrete Applied Mathematics,2009,157:596-601. |
|
Viewed |
|
|
|
Full text
|
|
|
|
|
Abstract
|
|
|
|
|
Cited |
|
|
|
|
|
Shared |
|
|
|
|
|
Discussed |
|
|
|
|