J4 ›› 2013, Vol. 48 ›› Issue (7): 85-92.
• Articles • Previous Articles Next Articles
CLC Number:
[1] | . On the Smarandachelyadjacentvertex edge coloring of some double graphs [J]. J4, 2009, 44(12): 25-29. |
[2] | DONG Ai-Jun, LI Guo-Jun, JU Jing-Song. List edge and list total colorings of planar graphs with adjacent triangles [J]. J4, 2009, 44(10): 17-20. |
[3] | WANG Chao. A degree condition for graphs to have Hamiltonian (g,f)-factors [J]. J4, 2009, 44(10): 21-25. |
[4] | LIU Shen-Sheng, SHU Zhi-Jiang. An upper bound on the vertex distinguishing IE total chromatic number of graphs [J]. J4, 2009, 44(10): 14-16. |
[5] | JU Jing-Song, LI Shuo, YANG Xin-Gang. Degree conditions for bipartite graphs to contain 6-cycles [J]. J4, 2009, 44(8): 13-15. |
[6] | GAO Yu-Fen, WEI Xiao-Li. On the extremal Merrifield-Simmons index with respect to trees having given number of endvertices [J]. J4, 2009, 44(8): 16-20. |
[7] | YUAN Xiu-Hua. Signed edge total domination numbers of graphs [J]. J4, 2009, 44(8): 21-24. |
[8] | LIU Hai-Yang, MA Cheng-Gang, WANG Zhi-Beng. Graham's conjecture on the product of the thorn graph [J]. J4, 2009, 44(8): 25-30. |
[9] | DUAN Ci-Meng, LV Ping-Li, MIAO Lian-Yang, MIAO Zheng-Ke. L(2,1,1)-Labeling of simple graphs [J]. J4, 2009, 44(8): 31-34. |
[10] | LIU Xiao-Yan. null [J]. J4, 2008, 43(12): 28-30. |
[11] | GENG Jian-yan,YAN Jin,LI Feng . Vertex-disjoint 4-cycle in a bipartite graph [J]. J4, 2008, 43(5): 87-92 . |
[12] | PAN Rui-xia,LAN Mei,LIU Gui-zhen . A condition of isolated toughness on the existence of fractional [a,b]-factors of graphs [J]. J4, 2008, 43(5): 93-96 . |
|