홈으로 icms논문검색 reference 검색 reference 통계 journal 통계
Title :
Journal :   Volume : Number : Year :
  Search:61 / Total:42237
No 인용횟수 Author Title Journal Volume Number Year
61   1   Cohnen, G.  Encheva, S.    Litsyn, S.    Intersecting codes and separating codes.   Discrete Appl. Math.   128   1   2003
60   1   Wang, Bing  Wu, Jian-Liang    Total colorings of planar graphs without intersecting 5-cycles.   Discrete Appl. Math.   160   12   2012
59   1   Hou, Jianfeng  Liu, Bin  Liu, Guizhen  Wu, Jianliang    Total coloring of planar graphs without 6-cycles.   Discrete Appl. Math.   159   2-3   2011
58   1   Du, Dingzhu  Shen, Lan  Wang, Yingqian    Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable.   Discrete Appl. Math.   157   13   2009
57   1   Chang, Gerard Jennhwa  Hou, Jianfeng  Roussel, Nicolas    Local condition for planar graphs of maximum degree 7 to be 8-totally colorable.   Discrete Appl. Math.   159   8   2011
56   1   Wang, Tao-Ming  Zhang, Guang-Hui    Note on $E$-super vertex magic graphs.   Discrete Appl. Math.   178     2014
55   1   Xing, Rundan  Zhou, Bo  Du, Zhibin    Further results on atom-bond connectivity index of trees.   Discrete Appl. Math.   158   14   2010
54   1   Xing, Rundan  Zhou, Bo  Dong, Fengming    On atom-bond connectivity index of connected graphs.   Discrete Appl. Math.   159   15   2011
53   1   Korneyenko, N. M.   Combinatorial algorithms on a class of graphs.   Discrete Appl. Math.   54   2-3   1994
52   1   Furtula, Boris  Graovac, Ante  Vukičević, Damir    Atom-bond connectivity index of trees.   Discrete Appl. Math.   157   13   2009
1 2 3 4 5 6 7