1. Anti-Ramsey coloring for matchings in complete bipartite graphs

   • Zemin Jin
   • Yuping Zang

   OriginalPaper 03 July 2015 Pages: 1 - 12

2. On consecutive edge magic total labelings of connected bipartite graphs

   • Bumtle Kang
   • Suh-Ryung Kim
   • Ji Yeon Park

   OriginalPaper 11 July 2015 Pages: 13 - 27

   

3. Upper bounds on the chromatic number of triangle-free graphs with a forbidden subtree

   • Xiao Wang
   • Baoyindureng Wu

   OriginalPaper 10 July 2015 Pages: 28 - 34

4. On the kidney exchange problem: cardinality constrained cycle and chain problems on directed graphs: a survey of integer programming approaches

   • Vicky Mak-Hau

   OriginalPaper 17 July 2015 Pages: 35 - 59

   

5. Benders decomposition for set covering problems

   • S. Haddadi

   OriginalPaper 22 July 2015 Pages: 60 - 80

   

6. Lower bounds for positive semidefinite zero forcing and their applications

   • Boting Yang

   OriginalPaper 23 July 2015 Pages: 81 - 105

   

7. A PTAS for minimum weighted connected vertex cover \(P_3\) problem in 3-dimensional wireless sensor networks

   • Limin Wang
   • Wenxue Du
   • Xiaoyan Zhang

   OriginalPaper 24 July 2015 Pages: 106 - 122

   

8. Erdős–Gallai-type results for colorful monochromatic connectivity of a graph

   • Qingqiong Cai
   • Xueliang Li
   • Di Wu

   OriginalPaper 22 July 2015 Pages: 123 - 131

   

9. A novel approach for detecting multiple rumor sources in networks with partial observations

   • Zhao Zhang
   • Wen Xu
   • Ding-Zhu Du

   OriginalPaper 01 August 2015 Pages: 132 - 146

   

10. A linear-time algorithm for clique-coloring problem in circular-arc graphs

    • Zuosong Liang
    • Erfang Shan
    • Yuzhong Zhang

    OriginalPaper 01 August 2015 Pages: 147 - 155

11. Coupon coloring of some special graphs

    • Yongtang Shi
    • Meiqin Wei
    • Yan Zhao

    OriginalPaper 07 August 2015 Pages: 156 - 164

    

12. Total weight choosability of Mycielski graphs

    • Yunfang Tang
    • Xuding Zhu

    OriginalPaper 14 August 2015 Pages: 165 - 182

    

13. A computational approach to the multi-period many-to-one matching with ties

    • Xinsheng Xiong
    • Yong Zhao
    • Yang Chen

    OriginalPaper 19 August 2015 Pages: 183 - 201

    

14. On the b-coloring of tight graphs

    • Mekkia Kouider
    • Mohamed Zamime

    OriginalPaper 02 September 2015 Pages: 202 - 214

    

15. Almost separable matrices

    • Matthew Aldridge
    • Leonardo Baldassini
    • Karen Gunderson

    OriginalPaper 12 October 2015 Pages: 215 - 236

    

16. Neighbor product distinguishing total colorings

    • Tong Li
    • Cunquan Qu
    • Xiaowei Yu

    OriginalPaper 12 September 2015 Pages: 237 - 253

    

17. Code for polyomino and computer search of isospectral polyominoes

    • Xiaodong Liang
    • Rui Wang
    • Ji xiang Meng

    OriginalPaper 21 September 2015 Pages: 254 - 264

    

18. Total coloring of planar graphs without adjacent short cycles

    • Huijuan Wang
    • Bin Liu
    • Hongwei Gao

    OriginalPaper 16 September 2015 Pages: 265 - 274

    

19. A solution to a conjecture on the generalized connectivity of graphs

    • Lily Chen
    • Xueliang Li
    • Yaping Mao

    OriginalPaper 18 September 2015 Pages: 275 - 282

    

20. On the difference of two generalized connectivities of a graph

    • Yuefang Sun
    • Xueliang Li

    OriginalPaper 10 September 2015 Pages: 283 - 291

21. Broadcasting on cactus graphs

    • Maja Čevnik
    • Janez Žerovnik

    OriginalPaper 16 September 2015 Pages: 292 - 316

    

22. On (p, 1)-total labelling of planar graphs

    • Lin Sun
    • Jian-Liang Wu

    OriginalPaper 05 October 2015 Pages: 317 - 325

23. Maximal independent sets in a generalisation of caterpillar graph

    • K. S. Neethi
    • Sanjeev Saxena

    OriginalPaper 26 September 2015 Pages: 326 - 332

    

24. Graphs with multiplicative vertex-coloring 2-edge-weightings

    • Joanna Skowronek-Kaziów

    OriginalPaper Open access 20 October 2015 Pages: 333 - 338

25. Minimized-cost cube query on heterogeneous information networks

    • Dan Yin
    • Hong Gao
    • Jianzhong Li

    OriginalPaper 22 October 2015 Pages: 339 - 364