Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
Skip header Section
Graph TheoryAugust 2008
Publisher:
  • Springer Publishing Company, Incorporated
ISBN:978-1-84628-969-9
Published:14 August 2008
Pages:
654
Skip Bibliometrics Section
Bibliometrics
Skip Abstract Section
Abstract

Graph theory is a flourishing discipline containing a body of beautiful and powerful theorems of wide applicability. Its explosive growth in recent years is mainly due to its role as an essential structure underpinning modern applied mathematics computer science, combinatorial optimization, and operations research in particular but also to its increasing application in the more applied sciences. The versatility of graphs makes them indispensable tools in the design and analysis of communication networks, for instance. The primary aim of this book is to present a coherent introduction to the subject, suitable as a textbook for advanced undergraduate and beginning graduate students in mathematics and computer science. It provides a systematic treatment of the theory of graphs without sacrificing its intuitive and aesthetic appeal. Commonly used proof techniques are described and illustrated, and a wealth of exercises - of varying levels of difficulty - are provided to help the reader master the techniques and reinforce their grasp of the material. A second objective is to serve as an introduction to research in graph theory. To this end, sections on more advanced topics are included, and a number of interesting and challenging open problems are highlighted and discussed in some detail. Despite this more advanced material, the book has been organized in such a way that an introductory course on graph theory can be based on the first few sections of selected chapters. Visit the graph theory book blog at: http://blogs.springer.com/bondyandmurty/.

Cited By

  1. Zhang Y and Wang L (2024). The signless Laplacian spectral radius of 2K 3-free graphs, Discrete Mathematics, 347:9, Online publication date: 1-Sep-2024.
  2. Wen C, Sun Q, Cai H, Guan H and Zhang C (2024). The homomorphism and coloring of the direct product of signed graphs, Applied Mathematics and Computation, 476:C, Online publication date: 1-Sep-2024.
  3. Sun C, Zhang Y and Zhang H (2024). The polyomino graphs whose resonance graphs have a 1-degree vertex, Applied Mathematics and Computation, 474:C, Online publication date: 1-Aug-2024.
  4. Liu H, You L, Hua H and Du Z (2024). Some sufficient conditions for graphs to be k-leaf-connected, Discrete Applied Mathematics, 352:C, (1-8), Online publication date: 31-Jul-2024.
  5. Xue J, Liu R and Liu P (2024). Independence number and spectral radius of cactus graphs, Discrete Applied Mathematics, 351:C, (81-93), Online publication date: 15-Jul-2024.
  6. Lv Y, Chen Z, Wu T and Zhang P (2024). On the weighted reverse cover cost of trees and unicyclic graphs with given diameter, Applied Mathematics and Computation, 473:C, Online publication date: 15-Jul-2024.
  7. Xu L (2024). Fault tolerability evaluation for the component edge-connectivity of folded Petersen networks, Applied Mathematics and Computation, 473:C, Online publication date: 15-Jul-2024.
  8. Huang S (2024). The optimal χ-bound for (P 7,C 4,C 5)-free graphs, Discrete Mathematics, 347:7, Online publication date: 1-Jul-2024.
  9. Song X, Zhang S, Chen X and Gao S (2024). The algebraic connectivity of barbell graphs, Discrete Mathematics, 347:7, Online publication date: 1-Jul-2024.
  10. ACM
    Gorsky M, Kawarabayashi K, Kreutzer S and Wiederrecht S Packing Even Directed Circuits Quarter-Integrally Proceedings of the 56th Annual ACM Symposium on Theory of Computing, (692-703)
  11. Gao W, Wang Y and Wang W (2024). A sufficient condition for a graph to be fractional (k,n)-critical, Discrete Mathematics, 347:6, Online publication date: 1-Jun-2024.
  12. Maceková M, Šárošiová Z and Soták R (2024). Interval vertex coloring, Applied Mathematics and Computation, 470:C, Online publication date: 1-Jun-2024.
  13. Chen M, Habib M and Lin C (2024). A novel edge connectivity based on edge partition for hypercube and folded hypercube, Applied Mathematics and Computation, 470:C, Online publication date: 1-Jun-2024.
  14. Kim W and Mémoli F (2024). Extracting Persistent Clusters in Dynamic Data via Möbius Inversion, Discrete & Computational Geometry, 71:4, (1276-1342), Online publication date: 1-Jun-2024.
  15. Niu M, Zhang Y, Liu J and Wang X (2024). Graphs with each edge in at most one maximum matching, Discrete Applied Mathematics, 349:C, (70-74), Online publication date: 31-May-2024.
  16. Wang Y, Deng J and Lu F (2024). Removable edges in Halin graphs, Discrete Applied Mathematics, 349:C, (1-7), Online publication date: 31-May-2024.
  17. Liu H and You L (2024). Extremal Kirchhoff index in polycyclic chains, Discrete Applied Mathematics, 348:C, (292-300), Online publication date: 15-May-2024.
  18. Tang M, Liu F and Lai H (2024). The list r-hued coloring of K m , n , Discrete Applied Mathematics, 348:C, (159-164), Online publication date: 15-May-2024.
  19. Huang Y, Zhang L and Dong F (2024). A new note on 1-planar graphs with minimum degree 7, Discrete Applied Mathematics, 348:C, (165-183), Online publication date: 15-May-2024.
  20. Hummel H and Igarashi A Keeping the Harmony Between Neighbors: Local Fairness in Graph Fair Division Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems, (852-860)
  21. Zhang J and Zhou S (2024). Nowhere-zero 3-flows in Cayley graphs on supersolvable groups, Journal of Combinatorial Theory Series A, 204:C, Online publication date: 1-May-2024.
  22. Chen M, Liu A and Zhang X (2024). The spectral radius of minor-free graphs, European Journal of Combinatorics, 118:C, Online publication date: 1-May-2024.
  23. Tu J, Zhang L and Du J (2024). On the maximum number of maximum dissociation sets in trees with given dissociation number, Discrete Mathematics, 347:5, Online publication date: 1-May-2024.
  24. Ju Y and Huang S (2024). Near optimal colourability on hereditary graph families, Theoretical Computer Science, 993:C, Online publication date: 27-Apr-2024.
  25. Chen M, Lin C and Pai K (2024). A tree structure for local diagnosis in multiprocessor systems under the comparison model, Theoretical Computer Science, 992:C, Online publication date: 21-Apr-2024.
  26. Dong Y, Broersma H, Bai Y and Zhang S (2024). The complexity of spanning tree problems involving graphical indices, Discrete Applied Mathematics, 347:C, (143-154), Online publication date: 15-Apr-2024.
  27. Liu J, Yang H, Zhang X and Lai H (2024). Symmetric cores and extremal size bound for supereulerian semicomplete bipartite digraphs, Discrete Mathematics, 347:4, Online publication date: 1-Apr-2024.
  28. Guzmán-Pro S (2024). Full-homomorphisms to paths and cycles, Discrete Mathematics, 347:3, Online publication date: 1-Mar-2024.
  29. Li P (2024). Constraining MC-numbers by the connectivity of complement graphs, Discrete Mathematics, 347:3, Online publication date: 1-Mar-2024.
  30. Kung T (2024). Reliability evaluation for bijection-connected networks based on the super P -connectivity, Applied Mathematics and Computation, 464:C, Online publication date: 1-Mar-2024.
  31. He X and Lu F (2024). The cubic vertices of solid minimal bricks, Discrete Mathematics, 347:2, Online publication date: 1-Feb-2024.
  32. Ji Z, Klasing R, Li W, Mao Y and Zhang X (2024). Erdös–Gallai-type problems for distance-edge-monitoring numbers, Discrete Applied Mathematics, 342:C, (275-285), Online publication date: 15-Jan-2024.
  33. Gan Z and Xu Y (2024). On defect restricted matching extension graphs, Discrete Applied Mathematics, 342:C, (76-81), Online publication date: 15-Jan-2024.
  34. Xu L and Zhou B (2024). The path-index of a graph, Applied Mathematics and Computation, 461:C, Online publication date: 15-Jan-2024.
  35. Wei W, Liu Y and Zhang Q (2024). An optimal pruned traversal tree-based fast minimum cut solver in dense graph, Information Sciences: an International Journal, 652:C, Online publication date: 1-Jan-2024.
  36. Fujisawa J, Tsugaki M, Yamashita T and Yashima T (2024). Hamilton cycles passing through a matching in a bipartite graph with high degree sum, Discrete Mathematics, 347:1, Online publication date: 1-Jan-2024.
  37. Guzmán-Pro S and Hochstättler W (2024). Oriented cobicircular matroids are GSP , Discrete Mathematics, 347:1, Online publication date: 1-Jan-2024.
  38. Li B, Liu X and Wang S (2024). Forbidden pairs of disconnected graphs for supereulerianity of connected graphs, Discrete Mathematics, 347:1, Online publication date: 1-Jan-2024.
  39. ACM
    Peham T, Burgholzer L and Wille R (2023). On Optimal Subarchitectures for Quantum Circuit Mapping, ACM Transactions on Quantum Computing, 4:4, (1-20), Online publication date: 31-Dec-2024.
  40. Guo S and Zhang R (2023). Maximizing the signless Laplacian spectral radius of minimally 3-connected graphs with given size, Discrete Applied Mathematics, 341:C, (204-211), Online publication date: 31-Dec-2024.
  41. Huang S and Li Z (2023). Vertex-critical ( P 5 , c h a i r )-free graphs, Discrete Applied Mathematics, 341:C, (9-15), Online publication date: 31-Dec-2024.
  42. Hu W, Li Y, Liu H and Hu X (2023). Anti-Ramsey problems in the Mycielskian of a cycle, Applied Mathematics and Computation, 459:C, Online publication date: 15-Dec-2023.
  43. Chiba S, Tsugaki M and Yamashita T (2023). A degree condition for cycles passing through specified vertices and edges, Discrete Mathematics, 346:12, Online publication date: 1-Dec-2023.
  44. Jiang T, Sun Q, Zhang S and Zhang C (2023). The perfect matching and tight Hamilton cycle decomposition of complete n-balanced mk-partite k-uniform hypergraphs, Discrete Mathematics, 346:12, Online publication date: 1-Dec-2023.
  45. Abrishami G and Erfanian A (2023). A note on Reed's conjecture for triangle-free graphs, Discrete Mathematics, 346:12, Online publication date: 1-Dec-2023.
  46. Li P, Zhang S, Hu X and Yang W (2023). Structural diagnosability of hypercubes under the PMC and MM* models, Theoretical Computer Science, 980:C, Online publication date: 20-Nov-2023.
  47. Jin Q, Li S and Xie M (2023). 3-path-connectivity of Cayley graphs generated by transposition trees, Discrete Applied Mathematics, 339:C, (292-299), Online publication date: 15-Nov-2023.
  48. Lou J, Wang L and Yuan M (2023). On the α-index of minimally 2-connected graphs with given order or size, Discrete Applied Mathematics, 339:C, (281-291), Online publication date: 15-Nov-2023.
  49. Yang Y, Hua X and Yang L (2023). Hyper K 1 , r and sub-K 1 , r fault tolerance of star graphs, Discrete Applied Mathematics, 339:C, (172-177), Online publication date: 15-Nov-2023.
  50. Zhu W, Hao R, Feng Y and Lee J (2023). Path connectivity of line graphs and total graphs of complete bipartite graphs, Applied Mathematics and Computation, 457:C, Online publication date: 15-Nov-2023.
  51. Khaleghi A and Zaker M (2023). More results on the z-chromatic number of graphs, Discrete Applied Mathematics, 338:C, (89-99), Online publication date: 30-Oct-2023.
  52. Qiu Z, Tang Z and Li Q (2023). Eccentricity spectral radius of t-clique trees with given diameter, Discrete Applied Mathematics, 337:C, (202-217), Online publication date: 15-Oct-2023.
  53. Nan L, Wang S and Zhao L (2023). Fault-tolerant strong Menger connectivity of modified bubble-sort graphs, Theoretical Computer Science, 971:C, Online publication date: 6-Sep-2023.
  54. Fandinno J and Hecher M Treewidth-aware complexity for evaluating epistemic logic programs Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, (3203-3211)
  55. de Paula Silva C, Nunes da Silva C and Lee O (2023). A family of counterexamples for a conjecture of Berge on α-diperfect digraphs, Discrete Mathematics, 346:8, Online publication date: 1-Aug-2023.
  56. ACM
    Tan R, Asuncion A, Lim B, Soos M and Ikeda K The Pancake Graph of Order 10 Is 4-Colorable Proceedings of the 2023 6th International Conference on Mathematics and Statistics, (1-6)
  57. Qiao H and Meng J (2023). Two-disjoint-cycle-cover vertex pancyclicity of augmented cubes, Theoretical Computer Science, 958:C, Online publication date: 22-May-2023.
  58. Ma Y and Zhang X (2023). Graphs with (strong) proper connection numbers m − 3 and m − 4 , Applied Mathematics and Computation, 445:C, Online publication date: 15-May-2023.
  59. Wei J and Zhang S (2023). Proof of a conjecture on the spectral radius condition for [a,b]-factors, Discrete Mathematics, 346:3, Online publication date: 1-Mar-2023.
  60. Čekanová K, Maceková M, Šárošiová Z and Soták R (2023). Light 3-stars in embedded graphs, Discrete Mathematics, 346:3, Online publication date: 1-Mar-2023.
  61. Liang L, Liu F and Lai H (2023). On list r-hued coloring of outer-1-planar graphs, Applied Mathematics and Computation, 440:C, Online publication date: 1-Mar-2023.
  62. Xu Y (2023). On the structure of pentagraphs, Applied Mathematics and Computation, 439:C, Online publication date: 15-Feb-2023.
  63. Cai J, Li W, Cai W and Dehmer M (2023). List injective coloring of planar graphs, Applied Mathematics and Computation, 439:C, Online publication date: 15-Feb-2023.
  64. Ducoffe G (2023). Distance problems within Helly graphs and k-Helly graphs, Theoretical Computer Science, 946:C, Online publication date: 10-Feb-2023.
  65. Yang Y (2023). Embedded edge connectivity of k-ary n-cubes, Information Processing Letters, 180:C, Online publication date: 1-Feb-2023.
  66. Li L, Li C, Luo R, Zhang C and Zhang H (2023). Flows of 3-edge-colorable cubic signed graphs, European Journal of Combinatorics, 108:C, Online publication date: 1-Feb-2023.
  67. Zhang J and Zhang Z (2023). Nowhere-zero 3-flows in Cayley graphs of order pq 2 , Discrete Mathematics, 346:2, Online publication date: 1-Feb-2023.
  68. Guzmán-Pro S, Hell P and Hernández-Cruz C (2022). Describing hereditary properties by forbidden circular orderings, Applied Mathematics and Computation, 438:C, Online publication date: 1-Feb-2023.
  69. Ali A, Albalahi A, Alanazi A, Bhatti A and Hamza A (2023). On the maximum sigma index of k-cyclic graphs, Discrete Applied Mathematics, 325:C, (58-62), Online publication date: 30-Jan-2023.
  70. Gu R, Lei H, Lian X and Taoqiu Z (2023). Weak-odd chromatic index of special digraph classes, Discrete Applied Mathematics, 325:C, (79-86), Online publication date: 30-Jan-2023.
  71. Zhao S and Chang J (2023). Reliability assessment of the divide-and-swap cube in terms of generalized connectivity, Theoretical Computer Science, 943:C, (1-15), Online publication date: 17-Jan-2023.
  72. García-Altamirano J and Hernández-Cruz C (2023). Minimal obstructions for a matrix partition problem in chordal graphs, Discrete Applied Mathematics, 324:C, (58-66), Online publication date: 15-Jan-2023.
  73. Xu L (2023). Symmetric property and the bijection between perfect matchings and sub-hypercubes of enhanced hypercubes, Discrete Applied Mathematics, 324:C, (41-45), Online publication date: 15-Jan-2023.
  74. Dong Y, Broersma H, Song C, Wan P and Zhang S (2023). The effect of graph operations on the degree-based entropy, Applied Mathematics and Computation, 437:C, Online publication date: 15-Jan-2023.
  75. Liu X, Zhou S, Cheng E and Zhang H (2023). Reliability analysis of the generalized balanced hypercube, Theoretical Computer Science, 942:C, (297-311), Online publication date: 9-Jan-2023.
  76. Zhang H, Zhou S, Liu X and Yu Z (2023). Extra (component) connectivity and diagnosability of bubble sort networks, Theoretical Computer Science, 940:PA, (180-189), Online publication date: 9-Jan-2023.
  77. Goedgebeur J, Huang S, Ju Y and Merkel O (2023). Colouring graphs with no induced six-vertex path or diamond, Theoretical Computer Science, 941:C, (278-299), Online publication date: 4-Jan-2023.
  78. Yang Y and Song N (2023). Fault-free Hamiltonian paths passing through prescribed linear forests in balanced hypercubes with faulty links, Theoretical Computer Science, 939:C, (161-169), Online publication date: 4-Jan-2023.
  79. Silva C, da Silva C and Lee O (2023). Obstructions for χ-diperfectness, Procedia Computer Science, 223:C, (201-208), Online publication date: 1-Jan-2023.
  80. Xiong W, Liu F, Wu Y, Zhan M and Lai H (2023). Complete family reduction and spanning connectivity in line graphs, Discrete Mathematics, 346:1, Online publication date: 1-Jan-2023.
  81. Bai Y and Li B (2023). Connected k-factors in bipartite graphs, Discrete Mathematics, 346:1, Online publication date: 1-Jan-2023.
  82. Zhu W, Hao R, Feng Y and Lee J (2023). The 3-path-connectivity of the k-ary n-cube, Applied Mathematics and Computation, 436:C, Online publication date: 1-Jan-2023.
  83. Talebi S, Alemzadeh S, Ratliff L and Mesbahi M Distributed Learning in Network Games: a Dual Averaging Approach 2019 IEEE 58th Conference on Decision and Control (CDC), (5544-5549)
  84. Abdolali M and Gillis N (2022). Revisiting data augmentation for subspace clustering, Knowledge-Based Systems, 258:C, Online publication date: 22-Dec-2022.
  85. Gao W, Wang W and Chen Y (2022). Tight isolated toughness bound for fractional ( k , n )-critical graphs, Discrete Applied Mathematics, 322:C, (194-202), Online publication date: 15-Dec-2022.
  86. Ren Y and Wang S (2022). Local diagnosability of bipartite graphs with conditional faulty edges under Preparata, Metze and Chien’s model, Discrete Applied Mathematics, 322:C, (286-294), Online publication date: 15-Dec-2022.
  87. Zhu W, Hao R and Li L (2022). The 3-path-connectivity of the hypercubes, Discrete Applied Mathematics, 322:C, (203-209), Online publication date: 15-Dec-2022.
  88. Zhu E, Wu P and Shao Z (2022). Exact algorithms for counting 3-colorings of graphs, Discrete Applied Mathematics, 322:C, (74-93), Online publication date: 15-Dec-2022.
  89. Li Y, Liu H and Hu X (2022). Anti-Ramsey numbers for cycles in n-prisms, Discrete Applied Mathematics, 322:C, (1-8), Online publication date: 15-Dec-2022.
  90. Gan Z and Xu Y (2022). Hamiltonian and long paths in bipartite graphs with connectivity, Discrete Mathematics, 345:12, Online publication date: 1-Dec-2022.
  91. Lin X, Wang K, Zhang M and Lai H (2022). Bounding ℓ-edge-connectivity in edge-connectivity, Discrete Applied Mathematics, 321:C, (350-356), Online publication date: 15-Nov-2022.
  92. Qi J, Ni J and Geng X (2022). The expected values for the Kirchhoff indices in the random cyclooctatetraene and spiro chains, Discrete Applied Mathematics, 321:C, (240-249), Online publication date: 15-Nov-2022.
  93. Chen Y, Fan S, Lai H and Xu M (2022). Graph r-hued colorings—A survey, Discrete Applied Mathematics, 321:C, (24-48), Online publication date: 15-Nov-2022.
  94. Wu J, Wang L and Yang W (2022). Learning to compute the metric dimension of graphs, Applied Mathematics and Computation, 432:C, Online publication date: 1-Nov-2022.
  95. Wei W, Hu Q and Yang W (2022). Accelerate minimum cut calculation by tree-cut mapping with local pruning, Advances in Engineering Software, 173:C, Online publication date: 1-Nov-2022.
  96. Ducoffe G (2022). Optimal Centrality Computations Within Bounded Clique-Width Graphs, Algorithmica, 84:11, (3192-3222), Online publication date: 1-Nov-2022.
  97. Guo S and Zhang R (2022). Sharp upper bounds on the Q-index of (minimally) 2-connected graphs with given size, Discrete Applied Mathematics, 320:C, (408-415), Online publication date: 30-Oct-2022.
  98. Chen S, Hao R and Qin X (2022). Bounds for the connected domination number of maximal outerplanar graphs, Discrete Applied Mathematics, 320:C, (235-244), Online publication date: 30-Oct-2022.
  99. Brause C, Geißer M and Schiermeyer I (2022). Homogeneous sets, clique-separators, critical graphs, and optimal χ-binding functions, Discrete Applied Mathematics, 320:C, (211-222), Online publication date: 30-Oct-2022.
  100. Lei L, Li X, Wu Y, Zhang T and Lai H (2022). Strengthened Ore conditions for ( s , t )-supereulerian graphs, Discrete Applied Mathematics, 320:C, (68-80), Online publication date: 30-Oct-2022.
  101. Zhang Y, Wang X and Yuan J (2022). Bicritical graphs without removable edges, Discrete Applied Mathematics, 320:C, (1-10), Online publication date: 30-Oct-2022.
  102. Chen M, Hsu D and Lin C (2022). A new structure for a vertex to be locally t-diagnosable in large multiprocessor systems, Theoretical Computer Science, 934:C, (81-90), Online publication date: 23-Oct-2022.
  103. Mahalingam K and Rajendran H (2022). Properties of m-bonacci-sum graphs, Discrete Applied Mathematics, 319:C, (149-158), Online publication date: 15-Oct-2022.
  104. Tian Y and Zhu Q (2022). r-component diagnosability of hypercubes under the PMC model, Theoretical Computer Science, 933:C, (114-124), Online publication date: 14-Oct-2022.
  105. Guzmán-Pro S and Hernández-Cruz C (2022). Oriented expressions of graph properties, European Journal of Combinatorics, 105:C, Online publication date: 1-Oct-2022.
  106. Kaiser T and Vrána P (2022). Hamilton cycles in line graphs of 3-hypergraphs, Discrete Mathematics, 345:10, Online publication date: 1-Oct-2022.
  107. Dong W, Xu B and Xu Y (2022). On the chromatic number of some P 5-free graphs, Discrete Mathematics, 345:10, Online publication date: 1-Oct-2022.
  108. Wang N, Meng J and Tian Y (2022). Reliability evaluation of Modified bubble-sort graph networks based on structure fault pattern, Applied Mathematics and Computation, 430:C, Online publication date: 1-Oct-2022.
  109. Shen X, Yao X, Tu H and Gong D (2022). Parallel multi-objective evolutionary optimization based dynamic community detection in software ecosystem, Knowledge-Based Systems, 252:C, Online publication date: 27-Sep-2022.
  110. Ducoffe G (2022). Eccentricity queries and beyond using hub labels, Theoretical Computer Science, 930:C, (128-141), Online publication date: 21-Sep-2022.
  111. Li G and Zhang M (2022). Sharp bounds on the Arithmetic–geometric index of graphs and line graphs, Discrete Applied Mathematics, 318:C, (47-60), Online publication date: 15-Sep-2022.
  112. Cheng D (2022). Embedding mutually edge-disjoint cycles into locally twisted cubes, Theoretical Computer Science, 929:C, (11-17), Online publication date: 11-Sep-2022.
  113. Feng W and Wang S (2022). The diagnosability of wheel networks with the condition, Theoretical Computer Science, 928:C, (48-60), Online publication date: 3-Sep-2022.
  114. Aparecida de Paula Silva C, Nunes da Silva C and Lee O (2022). χ-Diperfect digraphs, Discrete Mathematics, 345:9, Online publication date: 1-Sep-2022.
  115. Ma Y and Zhu W (2022). Some results on the 3‐total‐rainbow index, Applied Mathematics and Computation, 427:C, Online publication date: 15-Aug-2022.
  116. Guo H, Sabir E and Mamut A (2022). The g-extra connectivity of folded crossed cubes, Journal of Parallel and Distributed Computing, 166:C, (139-146), Online publication date: 1-Aug-2022.
  117. Liu X and Xiong L (2022). A note on 3-connected hourglass-free claw-free Hamilton-connected graphs, Discrete Mathematics, 345:8, Online publication date: 1-Aug-2022.
  118. Yu A, Li P, Wu Y and Lai H (2022). On the s-hamiltonianicity of an hourglass-free line graph, Discrete Mathematics, 345:8, Online publication date: 1-Aug-2022.
  119. Freitas L and Lee O (2022). Some Results on Berge’s Conjecture and Begin–End Conjecture, Graphs and Combinatorics, 38:4, Online publication date: 1-Aug-2022.
  120. Liu J, Han M and Lai H (2022). Modulo orientations and matchings in graphs, Discrete Mathematics, 345:7, Online publication date: 1-Jul-2022.
  121. Zhang S, Wang X, Yuan J, Ng C and Cheng T (2022). On cycle-nice claw-free graphs, Discrete Mathematics, 345:7, Online publication date: 1-Jul-2022.
  122. Wei W and Li S (2022). On the eccentricity spectra of complete multipartite graphs, Applied Mathematics and Computation, 424:C, Online publication date: 1-Jul-2022.
  123. Liang J, Zhao H and Yin J (2022). A method to calculate the number of spanning connected unicyclic(bicyclic) subgraphs in 2-separable networks, Theoretical Computer Science, 923:C, (144-159), Online publication date: 26-Jun-2022.
  124. Chen H, Chen M, Habib M and Lin C (2022). Connectivity for some families of composition networks, Theoretical Computer Science, 922:C, (361-367), Online publication date: 24-Jun-2022.
  125. Li W, Zhang S and Li R (2022). Rainbow triangles in arc-colored digraphs, Discrete Applied Mathematics, 314:C, (169-180), Online publication date: 15-Jun-2022.
  126. Yang H and Meng J (2022). Paths in [ h , k ]-bipartite hypertournaments, Applied Mathematics and Computation, 423:C, Online publication date: 15-Jun-2022.
  127. Li L, Huang F and Yuan J (2022). Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic paths of length three, Discrete Mathematics, 345:6, Online publication date: 1-Jun-2022.
  128. Brause C, Doan T, Holub P, Kabela A, Ryjáček Z, Schiermeyer I and Vrána P (2022). Forbidden induced subgraphs for perfectness of claw-free graphs of independence number at least 4, Discrete Mathematics, 345:6, Online publication date: 1-Jun-2022.
  129. Chiba S, Tsugaki M and Yamashita T (2022). A Chvátal-Erdős condition for the existence of a cycle intersecting specified connected subgraphs, Discrete Mathematics, 345:6, Online publication date: 1-Jun-2022.
  130. Zhao S, Hao R and Wei C (2022). Internally disjoint trees in the line graph and total graph of the complete bipartite graph, Applied Mathematics and Computation, 422:C, Online publication date: 1-Jun-2022.
  131. Wang N, Meng J and Tian Y (2022). Neighbor-connectivity of pancake networks and burnt pancake networks, Theoretical Computer Science, 916:C, (31-39), Online publication date: 19-May-2022.
  132. Xu L, Yin S and Zhai L (2022). Diagnosability and hybrid diagnosability of some classes of graphs under the BPMC model, Theoretical Computer Science, 915:C, (45-54), Online publication date: 14-May-2022.
  133. Yang F and Wu J (2022). The total coloring of K 5-minor-free graphs, European Journal of Combinatorics, 102:C, Online publication date: 1-May-2022.
  134. Zhang J and Yan J (2022). Disjoint cycles and 2-factors with Fan-type condition in a graph, Discrete Mathematics, 345:4, Online publication date: 1-Apr-2022.
  135. Lei L, Xiong W, Xie Y, Zhan M and Lai H (2022). On the extended Clark-Wormold Hamiltonian-like index problem, Discrete Mathematics, 345:4, Online publication date: 1-Apr-2022.
  136. Liu H, Zhang R and Zhang S (2021). On the global strong resilience of fault Hamiltonian graphs, Applied Mathematics and Computation, 418:C, Online publication date: 1-Apr-2022.
  137. Qiu Z and Tang Z (2022). On the eccentricity spectra of threshold graphs, Discrete Applied Mathematics, 310:C, (75-85), Online publication date: 31-Mar-2022.
  138. Wang S (2022). The diagnosability of Möbius cubes for the g-extra condition, Theoretical Computer Science, 908:C, (76-88), Online publication date: 24-Mar-2022.
  139. Wei W, Liu F, Xiong W and Lai H (2022). On r-hued list coloring of K 4 ( 7 )-minor free graphs, Discrete Applied Mathematics, 309:C, (301-309), Online publication date: 15-Mar-2022.
  140. Li J, Ma Y, Miao Z, Shi Y, Wang W and Zhang C (2022). Nowhere-zero 3-flows in toroidal graphs, Journal of Combinatorial Theory Series B, 153:C, (61-80), Online publication date: 1-Mar-2022.
  141. Liu M and Gu X (2022). Spectral strengthening of a theorem on transversal critical graphs, Discrete Mathematics, 345:3, Online publication date: 1-Mar-2022.
  142. Li S, Wang Z and Zhang M (2022). On the extremal Sombor index of trees with a given diameter, Applied Mathematics and Computation, 416:C, Online publication date: 1-Mar-2022.
  143. Bonomo-Braberman F, Mazzoleni M, Rean M and Ries B (2022). On some special classes of contact B 0-VPG graphs, Discrete Applied Mathematics, 308:C, (111-129), Online publication date: 15-Feb-2022.
  144. Li J, Ma Y, Shi Y, Wang W and Wu Y (2022). On 3-flow-critical graphs, European Journal of Combinatorics, 100:C, Online publication date: 1-Feb-2022.
  145. Wei W, Li S and Zhang L (2022). Characterizing the extremal graphs with respect to the eccentricity spectral radius, and beyond, Discrete Mathematics, 345:2, Online publication date: 1-Feb-2022.
  146. Ren Y and Wang S (2022). Reliability analysis of godan graphs, Discrete Applied Mathematics, 307:C, (180-190), Online publication date: 30-Jan-2022.
  147. Kanwal S, Siddiqui M, Bonyah E, Shaikh T, Irshad I, Khalid S and Shang K (2022). Ordering Acyclic Connected Structures of Trees Having Greatest Degree-Based Invariants, Complexity, 2022, Online publication date: 1-Jan-2022.
  148. Bruhn H and Ulmer A (2022). Packing A-paths of length zero modulo four, European Journal of Combinatorics, 99:C, Online publication date: 1-Jan-2022.
  149. He X and Lu L (2022). On the largest and least eigenvalues of eccentricity matrix of trees, Discrete Mathematics, 345:1, Online publication date: 1-Jan-2022.
  150. Ducoffe G and Popa A (2021). The b-Matching problem in distance-hereditary graphs and beyond, Discrete Applied Mathematics, 305:C, (233-246), Online publication date: 31-Dec-2022.
  151. Fan D, Goryainov S and Lin H (2021). On the (signless Laplacian) spectral radius of minimally k-(edge)-connected graphs for small k , Discrete Applied Mathematics, 305:C, (154-163), Online publication date: 31-Dec-2022.
  152. Zhang H, Zhou S, Liu J, Zhou Q and Yu Z (2021). Reliability evaluation of DQcube based on g-good neighbor and g-component fault pattern, Discrete Applied Mathematics, 305:C, (179-190), Online publication date: 31-Dec-2022.
  153. Liu J, Lasfar O, Wei J, Zhang X and Lai H (2021). Matching and spanning trails in digraphs, Discrete Applied Mathematics, 304:C, (417-431), Online publication date: 15-Dec-2021.
  154. Zhuang H, Guo W, Li X, Liu X and Lin C (2021). The component connectivity, component diagnosability, and t/k-diagnosability of Bicube networks, Theoretical Computer Science, 896:C, (145-157), Online publication date: 6-Dec-2021.
  155. Feng K, Ma X and Wei W (2021). Subnetwork reliability analysis of bubble-sort graph networks, Theoretical Computer Science, 896:C, (98-110), Online publication date: 6-Dec-2021.
  156. Ma W, Zhang M, Meng J and Ma T (2021). Exponential type of many-to-many edge disjoint paths on ternary n-cubes, Journal of Parallel and Distributed Computing, 158:C, (67-79), Online publication date: 1-Dec-2021.
  157. Gao W and Wang W (2021). Tight binding number bound for P ≥3-factor uniform graphs, Information Processing Letters, 172:C, Online publication date: 1-Dec-2021.
  158. Xiong W, Song S and Lai H (2022). Polynomially determine if a graph is (s,3)-supereulerian, Discrete Mathematics, 344:12, Online publication date: 1-Dec-2021.
  159. Dong C, Meng J and Liu J (2021). Sufficient Ore type condition for a digraph to be supereulerian, Applied Mathematics and Computation, 410:C, Online publication date: 1-Dec-2021.
  160. Shi L, Gou K and Xie D (2021). Convergence analysis of first-order discrete multi-agent systems with cooperative-competitive mechanisms, Applied Mathematics and Computation, 410:C, Online publication date: 1-Dec-2021.
  161. Liu S, Hao R and Zhang C (2021). Rotation snark, Berge-Fulkerson conjecture and Catlin’s 4-flow reduction, Applied Mathematics and Computation, 410:C, Online publication date: 1-Dec-2021.
  162. Blind S, Creignou N and Olive F (2021). Locally definable vertex set properties are efficiently enumerable, Discrete Applied Mathematics, 303:C, (186-202), Online publication date: 15-Nov-2021.
  163. Zhu H and Pan P (2021). The restricted Chinese postman problems with penalties, Operations Research Letters, 49:6, (851-854), Online publication date: 1-Nov-2021.
  164. Liu J, Yang H, Lai H and Zhang X (2021). Symmetric core and spanning trails in directed networks, Discrete Mathematics, 344:11, Online publication date: 1-Nov-2021.
  165. Li S, Qin Z, Tu J and Yue J (2021). On Tree-Connectivity and Path-Connectivity of Graphs, Graphs and Combinatorics, 37:6, (2521-2533), Online publication date: 1-Nov-2021.
  166. Jiang S, Li H and Yan J (2022). Vertex-disjoint stars in K 1 , r-free graphs, Discrete Applied Mathematics, 302:C, (189-197), Online publication date: 30-Oct-2021.
  167. Lv J, Li J and Zhou N (2022). List injective edge-coloring of subcubic graphs, Discrete Applied Mathematics, 302:C, (163-170), Online publication date: 30-Oct-2021.
  168. ACM
    Zhai D, Shi Q, Zhang R, Cao H, Li B and Wang D Position optimization and resource allocation for cooperative heterogeneous aerial networks Proceedings of the 4th ACM MobiCom Workshop on Drone Assisted Wireless Communications for 5G and Beyond, (7-12)
  169. Li H, Zhang S, Ye C and Zhou S (2021). The g-component connectivity of graphs, Theoretical Computer Science, 889:C, (96-104), Online publication date: 8-Oct-2021.
  170. Kung T, Teng Y and Lin C (2021). Super fault-tolerance assessment of locally twisted cubes based on the structure connectivity, Theoretical Computer Science, 889:C, (25-40), Online publication date: 8-Oct-2021.
  171. Yang Y and Li J (2021). Hybrid fault-tolerant prescribed hyper-hamiltonian laceability of hypercubes, Theoretical Computer Science, 888:C, (108-116), Online publication date: 4-Oct-2021.
  172. Chang H, Ji M, Li X and Zhang J (2021). Conflict-free connection of trees, Journal of Combinatorial Optimization, 42:3, (340-353), Online publication date: 1-Oct-2021.
  173. Ali A and Došlić T (2021). Mostar index, Applied Mathematics and Computation, 404:C, Online publication date: 1-Sep-2021.
  174. Guo W and Torielli M (2021). On the Falk Invariant of Shi and Linial Arrangements, Discrete & Computational Geometry, 66:2, (751-768), Online publication date: 1-Sep-2021.
  175. Sabir E and Meng J (2021). Generalizations of the classics to spanning connectedness, Applied Mathematics and Computation, 403:C, Online publication date: 15-Aug-2021.
  176. Contreras-Mendoza F and Hernández-Cruz C (2021). Minimal obstructions to ( ∞ , k )-polarity in cographs, Discrete Mathematics, 344:7, Online publication date: 1-Jul-2021.
  177. Ryjáček Z and Vrána P (2021). Every 3-connected { K 1 , 3 , Z 7 }-free graph of order at least 21 is Hamilton-connected, Discrete Mathematics, 344:6, Online publication date: 1-Jun-2021.
  178. Liu C (2021). A note on domination number in maximal outerplanar graphs, Discrete Applied Mathematics, 293:C, (90-94), Online publication date: 15-Apr-2021.
  179. Kung T and Lin C (2021). Cluster connectivity of hypercube-based networks under the super fault-tolerance condition, Discrete Applied Mathematics, 293:C, (143-156), Online publication date: 15-Apr-2021.
  180. Imran M, Akhter S, Jamil M and Javaid M (2021). Computation of Topological Indices of NEPS of Graphs, Complexity, 2021, Online publication date: 1-Jan-2021.
  181. Liang Z, Wei H and Liu H (2021). A Linear-Time Algorithm for 4-Coloring Some Classes of Planar Graphs, Computational Intelligence and Neuroscience, 2021, Online publication date: 1-Jan-2021.
  182. Wei C, Salman M, Shahzaib S, Rehman M, Fang J and Uddin M (2021). Classes of Planar Graphs with Constant Edge Metric Dimension, Complexity, 2021, Online publication date: 1-Jan-2021.
  183. Hong Z, Xia Z, Chen F, Volkmann L and Uddin M (2021). Sufficient Conditions for Graphs to Be k-Connected, Maximally Connected, and Super-Connected, Complexity, 2021, Online publication date: 1-Jan-2021.
  184. Peres L and Dahab R (2021). Tutte’s 3-flow Conjecture for almost even graphs, Procedia Computer Science, 195:C, (280-288), Online publication date: 1-Jan-2021.
  185. ACM
    Vidanage A, Christen P, Ranbaduge T and Schnell R A Graph Matching Attack on Privacy-Preserving Record Linkage Proceedings of the 29th ACM International Conference on Information & Knowledge Management, (1485-1494)
  186. Bakhteh S, Ghaffari-Hadigheh A and Chaparzadeh N (2020). Identification of Minimum Set of Master Regulatory Genes in Gene Regulatory Networks, IEEE/ACM Transactions on Computational Biology and Bioinformatics, 17:3, (999-1009), Online publication date: 1-May-2020.
  187. Niu B, Zhang X and Gao Y (2020). Equitable partition of plane graphs with independent crossings into induced forests, Discrete Mathematics, 343:5, Online publication date: 1-May-2020.
  188. Dong C, Liu J and Meng J (2020). Supereulerian 3-path-quasi-transitive digraphs, Applied Mathematics and Computation, 372:C, Online publication date: 1-May-2020.
  189. Bonvicini S and Ferrari M (2020). On the minimum number of bond-edge types and tile types, Discrete Applied Mathematics, 277:C, (1-13), Online publication date: 30-Apr-2020.
  190. ACM
    Nikolić S, Zgheib G and Ienne P Straight to the Point Proceedings of the 2020 ACM/SIGDA International Symposium on Field-Programmable Gate Arrays, (150-160)
  191. Lajou D On Cartesian Products of Signed Graphs Algorithms and Discrete Applied Mathematics, (219-234)
  192. Niu B and Zhang X (2020). Light edges in 1-planar graphs of minimum degree 3, Discrete Mathematics, 343:2, Online publication date: 1-Feb-2020.
  193. Zhang X and Niu B (2019). Equitable partition of graphs into induced linear forests, Journal of Combinatorial Optimization, 39:2, (581-588), Online publication date: 1-Feb-2020.
  194. Zhang Z, Xiao Y and Cai N (2020). Graph Concatenations to Derive Weighted Fractal Networks, Complexity, 2020, Online publication date: 1-Jan-2020.
  195. Yu G, Chen X and Labatut V (2020). Network Similarity Measure and Ediz Eccentric Connectivity Index, Complexity, 2020, Online publication date: 1-Jan-2020.
  196. Bessy S, Dross F, Hriňáková K, Knor M and Škrekovski R (2019). The structure of graphs with given number of blocks and the maximum Wiener index, Journal of Combinatorial Optimization, 39:1, (170-184), Online publication date: 1-Jan-2020.
  197. Zhao L, Li H and Gao Y (2019). On the extremal graphs with respect to the total reciprocal edge-eccentricity, Journal of Combinatorial Optimization, 39:1, (115-137), Online publication date: 1-Jan-2020.
  198. Rahbani H, Rad N and Sadeghi M (2019). A note on the complexity of locating-total domination in graphs, Theoretical Computer Science, 799:C, (32-39), Online publication date: 24-Dec-2019.
  199. Sabir E, Mamut A and Vumar E (2019). The extra connectivity of the enhanced hypercubes, Theoretical Computer Science, 799:C, (22-31), Online publication date: 24-Dec-2019.
  200. Cao S and Huang S (2019). Graphs without five-vertex path and four-vertex cycle, Applied Mathematics and Computation, 363:C, Online publication date: 15-Dec-2019.
  201. Dehmamy N, Barabási A and Yu R Understanding the representation power of graph neural networks in learning graph topology Proceedings of the 33rd International Conference on Neural Information Processing Systems, (15413-15423)
  202. Li D, Hu X and Liu H (2022). Structure connectivity and substructure connectivity of twisted hypercubes, Theoretical Computer Science, 796:C, (169-179), Online publication date: 3-Dec-2019.
  203. Miao L, Zhang S, Li R and Yang W (2019). Structure fault tolerance of k-ary n-cube networks, Theoretical Computer Science, 795:C, (213-218), Online publication date: 26-Nov-2019.
  204. González Hermosillo de la Maza S and Hernández-Cruz C (2019). On the complexity of the k-kernel problem on cyclically k-partite digraphs, Theoretical Computer Science, 795:C, (9-19), Online publication date: 26-Nov-2019.
  205. Ma Y, Nie K, Jin F and Wang C (2019). Total rainbow connection numbers of some special graphs, Applied Mathematics and Computation, 360:C, (213-220), Online publication date: 1-Nov-2019.
  206. Hoffmann-Ostenhof A, Zhang C and Zhang Z (2019). Cycle double covers and non-separating cycles, European Journal of Combinatorics, 81:C, (276-284), Online publication date: 1-Oct-2019.
  207. Zhai D, Wang Y, Zhang R, Zhang Z and Wang D User Connectivity Maximization for D2D and Cellular Hybrid Networks with Non-Orthogonal Multiple Access 2019 IEEE 30th Annual International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC), (1-6)
  208. Zhang Y, Zhao S and Meng J (2019). Edge fault tolerance of graphs with respect to λ 2-optimal property, Theoretical Computer Science, 783:C, (95-104), Online publication date: 6-Sep-2019.
  209. Feng K, Ji Z and Wei W (2019). Subnetwork reliability analysis in k-ary n-cubes, Discrete Applied Mathematics, 267:C, (85-92), Online publication date: 31-Aug-2019.
  210. Ibiapina A and Silva A (2019). Graphs with Girth at Least 8 are b-continuous, Electronic Notes in Theoretical Computer Science (ENTCS), 346:C, (677-684), Online publication date: 30-Aug-2019.
  211. Couto F and Cunha L (2019). Hardness and Efficiency on Minimizing Maximum Distances for Graphs With Few P4's and (k,ℓ)-graphs, Electronic Notes in Theoretical Computer Science (ENTCS), 346:C, (355-367), Online publication date: 30-Aug-2019.
  212. Campos V, Lopes R, Maia A and Sau I (2019). Adapting The Directed Grid Theorem into an FPT Algorithm, Electronic Notes in Theoretical Computer Science (ENTCS), 346:C, (229-240), Online publication date: 30-Aug-2019.
  213. de Araújo P, Campêlo M, Corrêa R and Labbé M (2019). The Geodesic Classification Problem on Graphs, Electronic Notes in Theoretical Computer Science (ENTCS), 346:C, (65-76), Online publication date: 30-Aug-2019.
  214. Munarini E (2019). Pell graphs, Discrete Mathematics, 342:8, (2415-2428), Online publication date: 1-Aug-2019.
  215. Sun Y, Gutin G and Ai J (2019). Arc-disjoint strong spanning subdigraphs in compositions and products of digraphs, Discrete Mathematics, 342:8, (2297-2305), Online publication date: 1-Aug-2019.
  216. Ma G, Bian Q and Wang J (2019). The weighted vertex PI index of (n,m)-graphs with given diameter, Applied Mathematics and Computation, 354:C, (329-337), Online publication date: 1-Aug-2019.
  217. Li S, Zhang L and Zhang M (2019). On the extremal cacti of given parameters with respect to the difference of zagreb indices, Journal of Combinatorial Optimization, 38:2, (421-442), Online publication date: 1-Aug-2019.
  218. Yi D, Zhu J, Feng L, Wang J and Yang M (2019). Optimal r-dynamic coloring of sparse graphs, Journal of Combinatorial Optimization, 38:2, (545-555), Online publication date: 1-Aug-2019.
  219. ACM
    Coudert D, Ducoffe G and Popa A (2019). Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs, ACM Transactions on Algorithms, 15:3, (1-57), Online publication date: 31-Jul-2019.
  220. Huang F and Yuan J (2019). On strong proper connection number of cubic graphs, Discrete Applied Mathematics, 265:C, (104-119), Online publication date: 31-Jul-2019.
  221. Peng D and Wang X (2019). Ear decomposition and induced even cycles, Discrete Applied Mathematics, 264:C, (161-166), Online publication date: 15-Jul-2019.
  222. ACM
    Rojas-García Á, Hernández-Aguirre A and Valdez S On the selection of the optimal topology for particle swarm optimization Proceedings of the Genetic and Evolutionary Computation Conference, (55-62)
  223. ACM
    Fister I, Galvez A, Osaba E, Ser J, Iglesias A and Fister I Discovering dependencies among mined association rules with population-based metaheuristics Proceedings of the Genetic and Evolutionary Computation Conference Companion, (1668-1674)
  224. Lai H, Lv X and Xu M (2019). On r-hued colorings of graphs without short induced paths, Discrete Mathematics, 342:7, (1904-1911), Online publication date: 1-Jul-2019.
  225. Li X and Xia W (2019). Skew-rank of an oriented graph and independence number of its underlying graph, Journal of Combinatorial Optimization, 38:1, (268-277), Online publication date: 1-Jul-2019.
  226. Galby E, Mazzoleni M and Ries B (2019). Proper circular arc graphs as intersection graphs of pathson a grid, Discrete Applied Mathematics, 262:C, (195-202), Online publication date: 15-Jun-2019.
  227. Ducoffe G and Leitert A (2019). Equivalence between pathbreadth and strong pathbreadth, Discrete Applied Mathematics, 262:C, (185-188), Online publication date: 15-Jun-2019.
  228. Wang S and Wang M (2019). The g-good-neighbor and g-extra diagnosability of networks, Theoretical Computer Science, 773:C, (107-114), Online publication date: 14-Jun-2019.
  229. Araújo J, Sales C, Sau I and Silva A (2019). Weighted proper orientations of trees and graphs of bounded treewidth, Theoretical Computer Science, 771:C, (39-48), Online publication date: 1-Jun-2019.
  230. Ma G, Bian Q and Wang J (2019). The maximum PI index of bicyclic graphs with even number of edges, Information Processing Letters, 146:C, (13-16), Online publication date: 1-Jun-2019.
  231. Brause C, Holub P, Kabela A, Ryjáček Z, Schiermeyer I and Vrána P (2019). On forbidden induced subgraphs for K 1 , 3-free perfect graphs, Discrete Mathematics, 342:6, (1602-1608), Online publication date: 1-Jun-2019.
  232. Zhang X (2019). Upper bound on the sum of powers of the degrees of graphs with few crossings per edge, Applied Mathematics and Computation, 350:C, (163-169), Online publication date: 1-Jun-2019.
  233. Hell P, Hernández-Cruz C and Sales C (2019). Minimal obstructions to 2-polar cographs, Discrete Applied Mathematics, 261:C, (219-228), Online publication date: 31-May-2019.
  234. Gu R, Lai H, Liang Y, Miao Z and Zhang M (2019). Collapsible subgraphs of a 4-edge-connected graph, Discrete Applied Mathematics, 260:C, (272-277), Online publication date: 15-May-2019.
  235. Han M, Lai H and Liu J (2019). Modulo 5-orientations and degree sequences, Discrete Applied Mathematics, 260:C, (155-163), Online publication date: 15-May-2019.
  236. Yang Y, Li J and Wang S (2019). Embedding fault-free hamiltonian paths with prescribed linear forests into faulty ternary n-cubes, Theoretical Computer Science, 767:C, (1-15), Online publication date: 3-May-2019.
  237. Yang Y and Zhang L (2019). Fault-tolerant-prescribed hamiltonian laceability of balanced hypercubes, Information Processing Letters, 145:C, (11-15), Online publication date: 1-May-2019.
  238. Hu J, Wang G, Wu J, Yang D and Yu X (2019). Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 9, Discrete Mathematics, 342:5, (1392-1402), Online publication date: 1-May-2019.
  239. Mirehi N, Tahmasbi M and Targhi A (2019). Hand gesture recognition using topological features, Multimedia Tools and Applications, 78:10, (13361-13386), Online publication date: 1-May-2019.
  240. ACM
    Cabello S (2018). Subquadratic Algorithms for the Diameter and the Sum of Pairwise Distances in Planar Graphs, ACM Transactions on Algorithms, 15:2, (1-38), Online publication date: 30-Apr-2019.
  241. Boode A and Broersma H (2019). Decompositions of graphs based on a new graph product, Discrete Applied Mathematics, 259:C, (31-40), Online publication date: 30-Apr-2019.
  242. Zhu J and Bu Y (2019). List r-dynamic coloring of graphs with small maximum average degree, Discrete Applied Mathematics, 258:C, (254-263), Online publication date: 15-Apr-2019.
  243. Zhang M, Li S, Xu B and Wang G (2019). On the minimal eccentric connectivity indices of bipartite graphs with some given parameters, Discrete Applied Mathematics, 258:C, (242-253), Online publication date: 15-Apr-2019.
  244. Huang S, Li T and Shi Y (2019). Critical ( P 6 , b a n n e r )-free graphs, Discrete Applied Mathematics, 258:C, (143-151), Online publication date: 15-Apr-2019.
  245. Chen Z (2019). Hamiltonicity of claw-free graphs and Fan-type conditions, Discrete Mathematics, 342:4, (1066-1078), Online publication date: 1-Apr-2019.
  246. Zeng C and Wu C (2019). On the discontinuity of images recovered by noncovex nonsmooth regularized isotropic models with box constraints, Advances in Computational Mathematics, 45:2, (589-610), Online publication date: 1-Apr-2019.
  247. van Aardt S, Burger A, Frick M, Thomassen C and de Wet J (2019). Hamilton cycles in sparse locally connected graphs, Discrete Applied Mathematics, 257:C, (276-288), Online publication date: 31-Mar-2019.
  248. Zhao S, Hao R and Cheng E (2019). Two kinds of generalized connectivity of dual cubes, Discrete Applied Mathematics, 257:C, (306-316), Online publication date: 31-Mar-2019.
  249. Zhu E, Taranenko A, Shao Z and Xu J (2019). On graphs with the maximum edge metric dimension, Discrete Applied Mathematics, 257:C, (317-324), Online publication date: 31-Mar-2019.
  250. Miri M, Mohamedpour K, Darmani Y, Sarkar M and Tummala R (2022). An efficient resource allocation algorithm based on vertex coloring to mitigate interference among coexisting WBANs, Computer Networks: The International Journal of Computer and Telecommunications Networking, 151:C, (132-146), Online publication date: 14-Mar-2019.
  251. Chen J, Mi J, Xie B and Lin Y (2019). A fast attribute reduction method for large formal decision contexts, International Journal of Approximate Reasoning, 106:C, (1-17), Online publication date: 1-Mar-2019.
  252. Fernandes C, Hernández-Vélez C, Pina J and Ramírez Alfonsín J (2019). Counting Hamiltonian Cycles in the Matroid Basis Graph, Graphs and Combinatorics, 35:2, (539-550), Online publication date: 1-Mar-2019.
  253. Wang S, Tsuchiya S and Xiong L (2019). Forbidden Pairs for Equality of Connectivity and Edge-Connectivity of Graphs, Graphs and Combinatorics, 35:2, (419-426), Online publication date: 1-Mar-2019.
  254. Gastineau N, Holub P and Togni O (2019). On the packing chromatic number of subcubic outerplanar graphs, Discrete Applied Mathematics, 255:C, (209-221), Online publication date: 28-Feb-2019.
  255. Zhang L and Wang S (2019). Sufficient conditions for graphs with girth g to be maximally k-restricted edge connected, Discrete Applied Mathematics, 255:C, (320-325), Online publication date: 28-Feb-2019.
  256. Smith K, Spyrou L and Escudero J (2018). Graph-Variate Signal Analysis, IEEE Transactions on Signal Processing, 67:2, (293-305), Online publication date: 15-Jan-2019.
  257. Marle F, Jaber H, Pointurier C and Botev J (2019). Organizing Project Actors for Collective Decision-Making about Interdependent Risks, Complexity, 2019, Online publication date: 1-Jan-2019.
  258. Zhai D, Zhang R, Du J, Ding Z and Yu F (2018). Simultaneous Wireless Information and Power Transfer at 5G New Frequencies: Channel Measurement and Network Design, IEEE Journal on Selected Areas in Communications, 37:1, (171-186), Online publication date: 1-Jan-2019.
  259. Lü H (2019). Paired many-to-many two-disjoint path cover of balanced hypercubes with faulty edges, The Journal of Supercomputing, 75:1, (400-424), Online publication date: 1-Jan-2019.
  260. Zeng C, Jia R and Wu C (2019). An Iterative Support Shrinking Algorithm for Non-Lipschitz Optimization in Image Restoration, Journal of Mathematical Imaging and Vision, 61:1, (122-139), Online publication date: 1-Jan-2019.
  261. Chen M, Liu A and Zhang X (2019). Spectral Extremal Results with Forbidding Linear Forests, Graphs and Combinatorics, 35:1, (335-351), Online publication date: 1-Jan-2019.
  262. Li R, Broersma H and Zhang S (2019). Properly Edge-colored Theta Graphs in Edge-colored Complete Graphs, Graphs and Combinatorics, 35:1, (261-286), Online publication date: 1-Jan-2019.
  263. Hoffmann-Ostenhof A and Jatschka T (2019). Snarks with Special Spanning Trees, Graphs and Combinatorics, 35:1, (207-219), Online publication date: 1-Jan-2019.
  264. Lu X, Niu X and Cao H (2018). Some results on generalized strong external difference families, Designs, Codes and Cryptography, 86:12, (2857-2868), Online publication date: 1-Dec-2018.
  265. ACM
    Goldthorpe Z, Cannon J, Farebrother J, Friggstad Z and Nascimento M Using biconnected components for efficient identification of upstream features in large spatial networks (GIS cup) Proceedings of the 26th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, (630-633)
  266. Wang S and Ma X (2018). The g-extra connectivity and diagnosability of crossed cubes, Applied Mathematics and Computation, 336:C, (60-66), Online publication date: 1-Nov-2018.
  267. Zhu J, Bu Y, Pardalos M, Du H, Wang H and Liu B (2018). Optimal channel assignment and L(p, 1)-labeling, Journal of Global Optimization, 72:3, (539-552), Online publication date: 1-Nov-2018.
  268. Chang H, Doan T, Huang Z, Jendrol' S, Li X and Schiermeyer I (2018). Graphs with Conflict-Free Connection Number Two, Graphs and Combinatorics, 34:6, (1553-1563), Online publication date: 1-Nov-2018.
  269. Liu X, Lin H and Xiong L (2018). Forbidden Subgraphs and Weak Locally Connected Graphs, Graphs and Combinatorics, 34:6, (1671-1690), Online publication date: 1-Nov-2018.
  270. Chiba S (2018). On degree sum conditions for 2-factors with a prescribed number of cycles, Discrete Mathematics, 341:10, (2912-2918), Online publication date: 1-Oct-2018.
  271. Lv J and Huang D (2018). A new sufficient condition for a toroidal graph to be 4-choosable, Discrete Mathematics, 341:10, (2878-2882), Online publication date: 1-Oct-2018.
  272. Wang X, Zhang Y and Zhou J (2018). A characterization of cycle-forced bipartite graphs, Discrete Mathematics, 341:9, (2639-2645), Online publication date: 1-Sep-2018.
  273. Cavers M, Seyffarth K and White E (2018). Distinguishing chromatic numbers of complements of Cartesian products of complete graphs, Discrete Mathematics, 341:9, (2431-2441), Online publication date: 1-Sep-2018.
  274. Fernández-Baca D and Vakati S (2018). On compatibility and incompatibility of collections of unrooted phylogenetic trees, Discrete Applied Mathematics, 245:C, (42-58), Online publication date: 20-Aug-2018.
  275. Artigas D and Sritharan R (2018). On the contour of bipartite graphs, Discrete Applied Mathematics, 245:C, (148-154), Online publication date: 20-Aug-2018.
  276. Wang G, Zhao Y, Ying Y, Huang J and Winter R (2018). Data Aggregation Point Placement Problem in Neighborhood Area Networks of Smart Grid, Mobile Networks and Applications, 23:4, (696-708), Online publication date: 1-Aug-2018.
  277. Guo Z, Li X, Xu C and Zhang S (2018). Compatible Eulerian circuits in Eulerian (di)graphs with generalized transition systems, Discrete Mathematics, 341:7, (2104-2112), Online publication date: 1-Jul-2018.
  278. ACM
    da Silva Freire A, Lima K and Rojas D A System For Motif Search In Biological Networks Proceedings of the XIV Brazilian Symposium on Information Systems, (1-8)
  279. Xu T and Wang G (2018). Finding strongly connected components of simple digraphs based on generalized rough sets theory, Knowledge-Based Systems, 149:C, (88-98), Online publication date: 1-Jun-2018.
  280. Liu J, Yu A, Wang K and Lai H (2018). Degree sum and hamiltonian-connected line graphs, Discrete Mathematics, 341:5, (1363-1379), Online publication date: 1-May-2018.
  281. Song H, Lai H and Wu J (2018). List r-hued chromatic number of graphs with bounded maximum average degrees, Discrete Mathematics, 341:5, (1244-1252), Online publication date: 1-May-2018.
  282. Cai Q, Li X and Wu D (2018). Some extremal results on the colorful monochromatic vertex-connectivity of a graph, Journal of Combinatorial Optimization, 35:4, (1300-1311), Online publication date: 1-May-2018.
  283. Moazzez B and Soltani H (2018). Integer programming approach to static monopolies in graphs, Journal of Combinatorial Optimization, 35:4, (1009-1041), Online publication date: 1-May-2018.
  284. Wu C, Wang Y, Lu Z, Pardalos P, Xu D, Zhang Z and Du D (2018). Solving the degree-concentrated fault-tolerant spanning subgraph problem by DC programming, Mathematical Programming: Series A and B, 169:1, (255-275), Online publication date: 1-May-2018.
  285. Abdolmaleki M, Hutchinson J, Ilchi S, Mahmoodian E, Matsumoto N and Shabani M (2018). On Uniquely k-List Colorable Planar Graphs, Graphs on Surfaces, and Regular Graphs, Graphs and Combinatorics, 34:3, (383-394), Online publication date: 1-May-2018.
  286. Xie X, Qin X, Yu C and Xu X (2018). Test-cost-sensitive rough set based approach for minimum weight vertex cover problem, Applied Soft Computing, 64:C, (423-435), Online publication date: 1-Mar-2018.
  287. Kang L, Lu W, Wu Y, Ye D and Zhang C (2018). Circuit Decompositions and Shortest Circuit Coverings of Hypergraphs, Graphs and Combinatorics, 34:2, (365-372), Online publication date: 1-Mar-2018.
  288. Coudert D, Ducoffe G and Popa A Fully polynomial FPT algorithms for some classes of bounded clique-width graphs Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, (2765-2784)
  289. Churchley R and Mohar B A submodular measure and approximate gomory-hu theorem for packing odd trails Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, (210-218)
  290. Wang H, Xu J, Ma M, Zhang H and Yan Z (2018). A New Type of Graphical Passwords Based on Odd-Elegant Labelled Graphs, Security and Communication Networks, 2018, Online publication date: 1-Jan-2018.
  291. Riaza R and Gómez S (2018). Twin Subgraphs and Core-Semiperiphery-Periphery Structures, Complexity, 2018, Online publication date: 1-Jan-2018.
  292. Nicodemos D and Stehlk M (2018). Packing and covering odd cycles in cubic plane graphs with small faces, European Journal of Combinatorics, 67:C, (208-221), Online publication date: 1-Jan-2018.
  293. Ji S, Liu M and Wu J (2018). A lower bound of revised Szeged index of bicyclic graphs, Applied Mathematics and Computation, 316:C, (480-487), Online publication date: 1-Jan-2018.
  294. Campos V and Silva A (2018). Edge-b-Coloring Trees, Algorithmica, 80:1, (104-115), Online publication date: 1-Jan-2018.
  295. Bharathi A and Choudum S (2018). Colouring of $$(P_3 \cup P_2)$$(P3źP2)-free graphs, Graphs and Combinatorics, 34:1, (97-107), Online publication date: 1-Jan-2018.
  296. Fleischner H (2017). Reducing an arbitrary fullerene to the dodecahedron, Discrete Mathematics, 340:11, (2714-2722), Online publication date: 1-Nov-2017.
  297. Le N (2017). Chromatic Number of ISK4-Free Graphs, Graphs and Combinatorics, 33:6, (1635-1646), Online publication date: 1-Nov-2017.
  298. Tu J (2017). Efficient algorithm for the vertex cover Pk problem on cacti, Applied Mathematics and Computation, 311:C, (217-222), Online publication date: 15-Oct-2017.
  299. Cohen R, Cassuto Y, Cohen R and Cassuto Y (2017). Coding for Improved Throughput Performance in Network Switches, IEEE/ACM Transactions on Networking, 25:5, (2802-2814), Online publication date: 1-Oct-2017.
  300. Gong H and Li S (2017). The number of spanning trees of a family of 2-separable weighted graphs, Discrete Applied Mathematics, 229:C, (154-160), Online publication date: 1-Oct-2017.
  301. Zhu H, Chen S, Miao L and Lv X (2017). On list r-hued coloring of planar graphs, Journal of Combinatorial Optimization, 34:3, (874-890), Online publication date: 1-Oct-2017.
  302. Goddyn L and Xu Y (2017). On the Bounds of Conway's Thrackles, Discrete & Computational Geometry, 58:2, (410-416), Online publication date: 1-Sep-2017.
  303. Basak B (2017). 3-Regular Colored Graphs and Classification of Surfaces, Discrete & Computational Geometry, 58:2, (345-354), Online publication date: 1-Sep-2017.
  304. Li S, Shi Y and Tu J (2017). The Generalized 3-Connectivity of Cayley Graphs on Symmetric Groups Generated by Trees and Cycles, Graphs and Combinatorics, 33:5, (1195-1209), Online publication date: 1-Sep-2017.
  305. Linhares Sales C, Sampaio L and Silva A (2017). On the b-Continuity of the Lexicographic Product of Graphs, Graphs and Combinatorics, 33:5, (1165-1180), Online publication date: 1-Sep-2017.
  306. Sales C and Silva A (2017). The b-Continuity of Graphs with Large Girth, Graphs and Combinatorics, 33:5, (1139-1146), Online publication date: 1-Sep-2017.
  307. (2017). Equal relation between the extra connectivity and pessimistic diagnosability for some regular graphs, Theoretical Computer Science, 690:C, (59-72), Online publication date: 22-Aug-2017.
  308. Xia Y, Zhang L, Liu Z, Nie L and Li X (2017). Weakly Supervised Multimodal Kernel for Categorizing Aerial Photographs, IEEE Transactions on Image Processing, 26:8, (3748-3758), Online publication date: 1-Aug-2017.
  309. Liu Y and Liu W (2017). Fractional matching preclusion of graphs, Journal of Combinatorial Optimization, 34:2, (522-533), Online publication date: 1-Aug-2017.
  310. Martínez L, Bribiesca E and Guzmán A (2017). Chain coding representation of voxel-based objects with enclosing, edging and intersecting trees, Pattern Analysis & Applications, 20:3, (825-844), Online publication date: 1-Aug-2017.
  311. Aboulker P, Brettell N, Havet F, Marx D and Trotignon N (2017). Coloring Graphs with Constraints on Connectivity, Journal of Graph Theory, 85:4, (814-838), Online publication date: 1-Aug-2017.
  312. Araujo J, Cezar A and Silva A (2017). On the Existence of Tree Backbones that Realize the Chromatic Number on a Backbone Coloring, Journal of Graph Theory, 85:4, (808-813), Online publication date: 1-Aug-2017.
  313. (2017). Efficient algorithms for subdominant cycle-complete cost functions and cycle-complete solutions, Discrete Applied Mathematics, 225:C, (1-10), Online publication date: 10-Jul-2017.
  314. Bose P, Dujmović V, Morin P and Rioux-Maldague L (2017). New Bounds for Facial Nonrepetitive Colouring, Graphs and Combinatorics, 33:4, (817-832), Online publication date: 1-Jul-2017.
  315. Aardt S, Dunbar J, Frick M, Oellermann O and Wet J (2017). On Saito's Conjecture and the Oberly---Sumner Conjectures, Graphs and Combinatorics, 33:4, (583-594), Online publication date: 1-Jul-2017.
  316. Alcón L, Bonomo F and Mazzoleni M (2017). Vertex Intersection Graphs of Paths on a Grid, Graphs and Combinatorics, 33:4, (653-664), Online publication date: 1-Jul-2017.
  317. Akbari S, Csikvri P, Ghafari A, Khalashi Ghezelahmad S and Nahvi M (2017). Graphs with integer matching polynomial zeros, Discrete Applied Mathematics, 224:C, (1-8), Online publication date: 19-Jun-2017.
  318. Li R, Broersma H, Xu C and Zhang S (2017). Cycle extension in edge-colored complete graphs, Discrete Mathematics, 340:6, (1235-1241), Online publication date: 1-Jun-2017.
  319. Xiong L (2017). Characterization of forbidden subgraphs for the existence of even factors in a graph, Discrete Applied Mathematics, 223:C, (135-139), Online publication date: 31-May-2017.
  320. Zhu E and Xu J (2017). A sufficient condition for planar graphs with maximum degree 6 to be totally 8-colorable, Discrete Applied Mathematics, 223:C, (148-153), Online publication date: 31-May-2017.
  321. Jamil M and Tomescu I (2017). Minimum general sum-connectivity index of trees and unicyclic graphs having a given matching number, Discrete Applied Mathematics, 222:C, (143-150), Online publication date: 11-May-2017.
  322. (2017). Clique coloring B1-EPG graphs, Discrete Mathematics, 340:5, (1008-1011), Online publication date: 1-May-2017.
  323. Li S, Liu L and Wu Y (2017). On the coefficients of the independence polynomial of graphs, Journal of Combinatorial Optimization, 33:4, (1324-1342), Online publication date: 1-May-2017.
  324. Zhang X, Chen Y and Cheng T (2017). Polarity graphs and Ramsey numbers for C 4 versus stars, Discrete Mathematics, 340:4, (655-660), Online publication date: 1-Apr-2017.
  325. Xing R and Zhou B (2017). On the two largest distance eigenvalues of graph powers, Information Processing Letters, 119:C, (39-43), Online publication date: 1-Mar-2017.
  326. Bagchi B, Datta B and Spreer J (2017). A characterization of tightly triangulated 3-manifolds, European Journal of Combinatorics, 61:C, (133-137), Online publication date: 1-Mar-2017.
  327. Li S and Zhang H (2017). Proofs of three conjectures on the quotients of the (revised) Szeged index and the Wiener index and beyond, Discrete Mathematics, 340:3, (311-324), Online publication date: 1-Mar-2017.
  328. Adouane L (2017). Reactive versus cognitive vehicle navigation based on optimal local and global PELC, Robotics and Autonomous Systems, 88:C, (51-70), Online publication date: 1-Feb-2017.
  329. Liang Z, Shan E and Kang L (2017). The clique-transversal set problem in {claw,K4}-free planar graphs, Information Processing Letters, 118:C, (64-68), Online publication date: 1-Feb-2017.
  330. He D and Lin W (2017). On (s, t)-relaxed strong edge-coloring of graphs, Journal of Combinatorial Optimization, 33:2, (609-625), Online publication date: 1-Feb-2017.
  331. Mehlhorn K, Neumann A and Schmidt J (2017). Certifying 3-Edge-Connectivity, Algorithmica, 77:2, (309-335), Online publication date: 1-Feb-2017.
  332. Wang S, Wang Z and Wang M (2017). The 2-good-neighbor connectivity and 2-good-neighbor diagnosability of bubble-sort star graph networks, Discrete Applied Mathematics, 217:P3, (691-706), Online publication date: 30-Jan-2017.
  333. De Jesús J and Kelmans A (2017). On graphs uniquely defined by their K -circular matroids, Discrete Applied Mathematics, 217:P3, (474-487), Online publication date: 30-Jan-2017.
  334. Sun Y and Li X (2017). On the difference of two generalized connectivities of a graph, Journal of Combinatorial Optimization, 33:1, (283-291), Online publication date: 1-Jan-2017.
  335. Chen L, Li X, Liu M and Mao Y (2017). A solution to a conjecture on the generalized connectivity of graphs, Journal of Combinatorial Optimization, 33:1, (275-282), Online publication date: 1-Jan-2017.
  336. Shi Y, Wei M, Yue J and Zhao Y (2017). Coupon coloring of some special graphs, Journal of Combinatorial Optimization, 33:1, (156-164), Online publication date: 1-Jan-2017.
  337. Liang Z, Shan E and Zhang Y (2017). A linear-time algorithm for clique-coloring problem in circular-arc graphs, Journal of Combinatorial Optimization, 33:1, (147-155), Online publication date: 1-Jan-2017.
  338. Cai Q, Li X and Wu D (2017). Erdźs---Gallai-type results for colorful monochromatic connectivity of a graph, Journal of Combinatorial Optimization, 33:1, (123-131), Online publication date: 1-Jan-2017.
  339. Wang L, Du W, Zhang Z and Zhang X (2017). A PTAS for minimum weighted connected vertex cover $$P_3$$P3 problem in 3-dimensional wireless sensor networks, Journal of Combinatorial Optimization, 33:1, (106-122), Online publication date: 1-Jan-2017.
  340. Huang Z, Li X and Ma J (2017). $$Z_3$$Z3-Connectivity of Claw-Free Graphs, Graphs and Combinatorics, 33:1, (123-140), Online publication date: 1-Jan-2017.
  341. Liu M and Chen L (2016). Bicyclic graphs with maximal edge revised Szeged index, Discrete Applied Mathematics, 215:C, (225-230), Online publication date: 31-Dec-2016.
  342. Wu Y, Ye D and Zhang C (2016). Uniquely forced perfect matching and unique 3-edge-coloring, Discrete Applied Mathematics, 215:C, (203-207), Online publication date: 31-Dec-2016.
  343. Jiang S and Yan J (2016). Vertex-disjoint copies of K 1 , 3 in K 1 , r -free graphs, Discrete Mathematics, 339:12, (3085-3088), Online publication date: 6-Dec-2016.
  344. Zhang C, Wang Y and Chen M (2016). Planar graphs without adjacent cycles of length at most five are (1,1,0) -colorable, Discrete Mathematics, 339:12, (3032-3042), Online publication date: 6-Dec-2016.
  345. Cheng P, Chen M and Wang Y (2016). Planar graphs without 4-cycles adjacent to triangles are 4-choosable, Discrete Mathematics, 339:12, (3052-3057), Online publication date: 6-Dec-2016.
  346. Zhang M and Li S (2016). Extremal cacti of given matching number with respect to the distance spectral radius, Applied Mathematics and Computation, 291:C, (89-97), Online publication date: 1-Dec-2016.
  347. Fitzpatrick S, Howell J, Messinger M and Pike D (2016). A deterministic version of the game of zombies and survivors on graphs, Discrete Applied Mathematics, 213:C, (1-12), Online publication date: 20-Nov-2016.
  348. Zhang M and Li S (2016). Extremal Halin graphs with respect to the signless Laplacian spectra, Discrete Applied Mathematics, 213:C, (207-218), Online publication date: 20-Nov-2016.
  349. Lu L, Wu B and Tang Z (2016). Proof of a conjecture on the zero forcing number of a graph, Discrete Applied Mathematics, 213:C, (233-237), Online publication date: 20-Nov-2016.
  350. (2016). Fractional spanning tree packing, forest covering and eigenvalues, Discrete Applied Mathematics, 213:C, (219-223), Online publication date: 20-Nov-2016.
  351. Fabrici I, Jendrol' S and Voigt M (2016). Facial list colourings of plane graphs, Discrete Mathematics, 339:11, (2826-2831), Online publication date: 6-Nov-2016.
  352. Besharati N, Goddyn L, Mahmoodian E and Mortezaeefar M (2016). On the chromatic number of Latin square graphs, Discrete Mathematics, 339:11, (2613-2619), Online publication date: 6-Nov-2016.
  353. Liang Z, Shan E and Kang L (2016). Clique-Perfectness of Claw-Free Planar Graphs, Graphs and Combinatorics, 32:6, (2551-2562), Online publication date: 1-Nov-2016.
  354. Chen Z (2016). Chvátal---Erdös Type Conditions for Hamiltonicity of Claw-Free Graphs, Graphs and Combinatorics, 32:6, (2253-2266), Online publication date: 1-Nov-2016.
  355. Cheng J, Lorenzen K, Luo R and Thompson J (2016). A note on the size of edge-chromatic 4-critical graphs, Discrete Mathematics, 339:10, (2393-2398), Online publication date: 6-Oct-2016.
  356. (2016). On the lower bound of k -maximal digraphs, Discrete Mathematics, 339:10, (2500-2510), Online publication date: 6-Oct-2016.
  357. Hung R (2016). Hamiltonian cycles in linear-convex supergrid graphs, Discrete Applied Mathematics, 211:C, (99-112), Online publication date: 1-Oct-2016.
  358. Li S and Wei W (2016). Some edge-grafting transformations on the eccentricity resistance-distance sum and their applications, Discrete Applied Mathematics, 211:C, (130-142), Online publication date: 1-Oct-2016.
  359. (2016). The cost of perfection for matchings in graphs, Discrete Applied Mathematics, 210:C, (112-122), Online publication date: 10-Sep-2016.
  360. Zhang Y, Broersma H and Chen Y (2016). On fan-wheel and tree-wheel Ramsey numbers, Discrete Mathematics, 339:9, (2284-2287), Online publication date: 6-Sep-2016.
  361. Brousek J, Holub P, Ryjáček Z and Vrána P (2016). Finite families of forbidden subgraphs for rainbow connection in graphs, Discrete Mathematics, 339:9, (2304-2312), Online publication date: 6-Sep-2016.
  362. Zhang C (2016). Cycle covers (II) - Circuit chain, Petersen chain and Hamilton weights, Journal of Combinatorial Theory Series B, 120:C, (36-63), Online publication date: 1-Sep-2016.
  363. Aboulker P, Chen X, Huzhang G, Kapadia R and Supko C (2016). Lines, Betweenness and Metric Spaces, Discrete & Computational Geometry, 56:2, (427-448), Online publication date: 1-Sep-2016.
  364. Dong J and Li X (2016). Rainbow Connection Number and Independence Number of a Graph, Graphs and Combinatorics, 32:5, (1829-1841), Online publication date: 1-Sep-2016.
  365. Kemnitz A and Schiermeyer I (2016). Sufficient conditions for 2-rainbow connected graphs, Discrete Applied Mathematics, 209:C, (247-250), Online publication date: 20-Aug-2016.
  366. Cai Q, Li X and Zhao Y (2016). Note on the upper bound of the rainbow index of a graph, Discrete Applied Mathematics, 209:C, (68-74), Online publication date: 20-Aug-2016.
  367. Coudert D and Ducoffe G (2016). Data center interconnection networks are not hyperbolic, Theoretical Computer Science, 639:C, (72-90), Online publication date: 1-Aug-2016.
  368. Araujo J, Havet F, Linhares Sales C and Silva A (2016). Proper orientation of cacti, Theoretical Computer Science, 639:C, (14-25), Online publication date: 1-Aug-2016.
  369. Xu J, Li Z and Zhu E (2016). On purely tree-colorable planar graphs, Information Processing Letters, 116:8, (532-536), Online publication date: 1-Aug-2016.
  370. Huang J, Li S and Sun L (2016). The normalized Laplacians, degree-Kirchhoff index and the spanning trees of linear hexagonal chains, Discrete Applied Mathematics, 207:C, (67-79), Online publication date: 10-Jul-2016.
  371. Brause C and Schiermeyer I (2016). Kernelization of the 3 -path vertex cover problem, Discrete Mathematics, 339:7, (1935-1939), Online publication date: 6-Jul-2016.
  372. Dourado M (2016). Computing role assignments of split graphs, Theoretical Computer Science, 635:C, (74-84), Online publication date: 4-Jul-2016.
  373. Bonvicini S and Mazzuoccolo G (2016). Edge-Colorings of 4-Regular Graphs with the Minimum Number of Palettes, Graphs and Combinatorics, 32:4, (1293-1311), Online publication date: 1-Jul-2016.
  374. Gao Y, Wang G and Wu J (2016). A Relaxed Case on 1-2-3 Conjecture, Graphs and Combinatorics, 32:4, (1415-1421), Online publication date: 1-Jul-2016.
  375. Zhang J, Ding L, Wang G, Yan G and Zhou S (2016). Neighbor Sum Distinguishing Index of $$K_4$$K4-Minor Free Graphs, Graphs and Combinatorics, 32:4, (1621-1633), Online publication date: 1-Jul-2016.
  376. Yao J, Yu X, Wang G and Xu C (2016). Neighbor Sum (Set) Distinguishing Total Choosability of d-Degenerate Graphs, Graphs and Combinatorics, 32:4, (1611-1620), Online publication date: 1-Jul-2016.
  377. Deng A, Feng M and Kelmans A (2016). Adjacency polynomials of digraph transformations, Discrete Applied Mathematics, 206:C, (15-38), Online publication date: 19-Jun-2016.
  378. Zhang H, Li S and Zhao L (2016). On the further relation between the (revised) Szeged index and the Wiener index of graphs, Discrete Applied Mathematics, 206:C, (152-164), Online publication date: 19-Jun-2016.
  379. Li S and Wu Y (2016). On the extreme eccentric distance sum of graphs with some given parameters, Discrete Applied Mathematics, 206:C, (90-99), Online publication date: 19-Jun-2016.
  380. Ma G, Ji S, Bian Q and Li X (2016). The maximum matching energy of bicyclic graphs with even girth, Discrete Applied Mathematics, 206:C, (203-210), Online publication date: 19-Jun-2016.
  381. Chikhi R, Medvedev P, Milanič M and Raskhodnikova S (2016). On the readability of overlap digraphs, Discrete Applied Mathematics, 205:C, (35-44), Online publication date: 31-May-2016.
  382. Park J, Choi J and Lim H (2016). Algorithms for finding disjoint path covers in unit interval graphs, Discrete Applied Mathematics, 205:C, (132-149), Online publication date: 31-May-2016.
  383. Brimkov B and Hicks I (2016). Chromatic and flow polynomials of generalized vertex join graphs and outerplanar graphs, Discrete Applied Mathematics, 204:C, (13-21), Online publication date: 11-May-2016.
  384. Liang Y, Lai H, Luo R and Xu R (2016). Extendability of Contractible Configurations for Nowhere-Zero Flows and Modulo Orientations, Graphs and Combinatorics, 32:3, (1065-1075), Online publication date: 1-May-2016.
  385. Aubry Y, Godin J and Togni O (2016). Free Choosability of Outerplanar Graphs, Graphs and Combinatorics, 32:3, (851-859), Online publication date: 1-May-2016.
  386. Malyshev D (2016). A dichotomy for the dominating set problem for classes defined by small forbidden induced subgraphs, Discrete Applied Mathematics, 203:C, (117-126), Online publication date: 20-Apr-2016.
  387. Čada R, Kaneko A, Ryjáček Z and Yoshimoto K (2016). Rainbow cycles in edge-colored graphs, Discrete Mathematics, 339:4, (1387-1392), Online publication date: 6-Apr-2016.
  388. Li Z, Zhu E, Shao Z and Xu J (2016). Size of edge-critical uniquely 3-colorable planar graphs, Discrete Mathematics, 339:4, (1242-1250), Online publication date: 6-Apr-2016.
  389. Algefari M and Lai H (2016). Supereulerian Digraphs with Large Arc-Strong Connectivity, Journal of Graph Theory, 81:4, (393-402), Online publication date: 1-Apr-2016.
  390. Yu A, Liu J, Han M and Lai H (2016). On dense strongly Z 2 s + 1 -connected graphs, Discrete Mathematics, 339:2, (850-856), Online publication date: 6-Feb-2016.
  391. Chen M, Wang Y, Liu P and Xu J (2016). Planar graphs without cycles of length 4 or 5 are ( 2 , 0 , 0 ) -colorable, Discrete Mathematics, 339:2, (886-905), Online publication date: 6-Feb-2016.
  392. Lim H, Kim H and Park J (2016). Ore-type degree conditions for disjoint path covers in simple graphs, Discrete Mathematics, 339:2, (770-779), Online publication date: 6-Feb-2016.
  393. Holub P, Ryjáček Z, Schiermeyer I and Vrána P (2016). Characterizing forbidden pairs for rainbow connection in graphs with minimum degree 2, Discrete Mathematics, 339:2, (1058-1068), Online publication date: 6-Feb-2016.
  394. Jendrol' S, Maceková M, Montassier M and Soták R (2016). Optimal unavoidable sets of types of 3-paths for planar graphs of given girth, Discrete Mathematics, 339:2, (780-789), Online publication date: 6-Feb-2016.
  395. Fabrici I, Jendrol' S and Vrbjarová M (2016). Facial entire colouring of plane graphs, Discrete Mathematics, 339:2, (626-631), Online publication date: 6-Feb-2016.
  396. Zhu E, Li Z, Shao Z, Xu J and Liu C (2016). Acyclic 3-coloring of generalized Petersen graphs, Journal of Combinatorial Optimization, 31:2, (902-911), Online publication date: 1-Feb-2016.
  397. Li H, Yang Y and Wu B (2016). 2-Edge connected dominating sets and 2-Connected dominating sets of a graph, Journal of Combinatorial Optimization, 31:2, (713-724), Online publication date: 1-Feb-2016.
  398. Li S, Zhang H and Zhang M (2016). Further results on the reciprocal degree distance of graphs, Journal of Combinatorial Optimization, 31:2, (648-668), Online publication date: 1-Feb-2016.
  399. Yue J (2016). Acyclic and star coloring of P4-reducible and P4-sparse graphs, Applied Mathematics and Computation, 273:C, (68-73), Online publication date: 15-Jan-2016.
  400. Churchley R, Mohar B and Wu H Weak duality for packing edge-disjoint odd (u, v)-trails Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete algorithms, (2086-2094)
  401. Li Z, Zhu E, Shao Z and Xu J (2016). On dominating sets of maximal outerplanar and planar graphs, Discrete Applied Mathematics, 198:C, (164-169), Online publication date: 10-Jan-2016.
  402. Chen X and Miao P (2016). Nordhaus-Gaddum-type problems for lines in hypergraphs, Discrete Applied Mathematics, 198:C, (297-302), Online publication date: 10-Jan-2016.
  403. Song H, Lai H and Wu J (2016). On r -hued coloring of planar graphs with girth at least 6, Discrete Applied Mathematics, 198:C, (251-263), Online publication date: 10-Jan-2016.
  404. Fernandes C, Hernández-Vélez C, Lee O and de Pina J (2016). Spanning trees with nonseparating paths, Discrete Mathematics, 339:1, (365-374), Online publication date: 6-Jan-2016.
  405. Huang S (2016). Improved complexity results on k -coloring P t -free graphs, European Journal of Combinatorics, 51:C, (336-346), Online publication date: 1-Jan-2016.
  406. Shi Y, Zhang Y, Zhang Z and Wu W (2016). A greedy algorithm for the minimum $$2$$2-connected $$m$$m-fold dominating set problem, Journal of Combinatorial Optimization, 31:1, (136-151), Online publication date: 1-Jan-2016.
  407. Chao F, Ren H and Cao N (2016). Finding Shorter Cycles in a Weighted Graph, Graphs and Combinatorics, 32:1, (65-77), Online publication date: 1-Jan-2016.
  408. Li X, Mao Y, Wei M and Li R Searching for near Optimal Codes Proceedings of the 9th International Conference on Combinatorial Optimization and Applications - Volume 9486, (521-536)
  409. Miltzow T, Schmidt J and Xia M (2015). Counting K 4 -subdivisions, Discrete Mathematics, 338:12, (2387-2392), Online publication date: 6-Dec-2015.
  410. Campos V, Lima C, Martins N, Sampaio L, Santos M and Silva A (2015). The b-chromatic index of graphs, Discrete Mathematics, 338:11, (2072-2079), Online publication date: 6-Nov-2015.
  411. Pelt D and Bisseling R (2015). An exact algorithm for sparse matrix bipartitioning, Journal of Parallel and Distributed Computing, 85:C, (79-90), Online publication date: 1-Nov-2015.
  412. Zhang Y, Broersma H and Chen Y (2015). Three Results on Cycle-Wheel Ramsey Numbers, Graphs and Combinatorics, 31:6, (2467-2479), Online publication date: 1-Nov-2015.
  413. Chen Z, Han M, Lai H and Zhan M (2015). Graphs with a 3-Cycle-2-Cover, Graphs and Combinatorics, 31:6, (2103-2111), Online publication date: 1-Nov-2015.
  414. Li X and Mao Y (2015). On Extremal Graphs with at Most $$\ell $$ℓ Internally Disjoint Steiner Trees Connecting Any $$n-1$$n-1 Vertices, Graphs and Combinatorics, 31:6, (2231-2259), Online publication date: 1-Nov-2015.
  415. Ryjáček Z, Xiong L and Yin J (2015). Closure and Hamilton-Connected Claw-Free Hourglass-Free Graphs, Graphs and Combinatorics, 31:6, (2369-2376), Online publication date: 1-Nov-2015.
  416. Zhu T and Wu B (2015). Domination of maximal K 4 -minor free graphs and maximal K 2 , 3 -minor free graphs, and disproofs of two conjectures on planar graphs, Discrete Applied Mathematics, 194:C, (147-153), Online publication date: 30-Oct-2015.
  417. Sun Y (2015). On rainbow total-coloring of a graph, Discrete Applied Mathematics, 194:C, (171-177), Online publication date: 30-Oct-2015.
  418. Fleischner H and Häggkvist R (2015). Cycle double covers containing certain circuits in cubic graphs having special structures, Discrete Mathematics, 338:10, (1750-1754), Online publication date: 6-Oct-2015.
  419. Holub P, Ryjáček Z, Schiermeyer I and Vrána P (2015). Rainbow connection and forbidden subgraphs, Discrete Mathematics, 338:10, (1706-1713), Online publication date: 6-Oct-2015.
  420. Bujtás C and Tuza Z (2015). Approximability of the upper chromatic number of hypergraphs, Discrete Mathematics, 338:10, (1714-1721), Online publication date: 6-Oct-2015.
  421. Bang-Jensen J and Casselgren C (2015). Restricted cycle factors and arc-decompositions of digraphs, Discrete Applied Mathematics, 193:C, (80-93), Online publication date: 1-Oct-2015.
  422. Chao F, Ren H and Cao N (2015). Finding a shortest cycle in a subspace of the cycle space of a graph, Applied Mathematics and Computation, 268:C, (393-398), Online publication date: 1-Oct-2015.
  423. Devos M, Mohar B and Šámal R (2015). Highly arc-transitive digraphs -- Structure and counterexamples, Combinatorica, 35:5, (553-571), Online publication date: 1-Oct-2015.
  424. ACM
    Jordaan I and Marshall L Edit Distance-based Digraph Similarity Proceedings of the 2015 Annual Research Conference on South African Institute of Computer Scientists and Information Technologists, (1-10)
  425. Tian R and Xiong L (2015). The Chvátal---Erdős Condition for a Graph to Have a Spanning Trail, Graphs and Combinatorics, 31:5, (1739-1754), Online publication date: 1-Sep-2015.
  426. Kang Y and Wang Y (2015). Distance Constraints on Short Cycles for 3-Colorability of Planar graphs, Graphs and Combinatorics, 31:5, (1497-1505), Online publication date: 1-Sep-2015.
  427. Bálint T and Czap J (2015). Facial Parity 9-Edge-Coloring of Outerplane Graphs, Graphs and Combinatorics, 31:5, (1177-1187), Online publication date: 1-Sep-2015.
  428. Wang X, Shang W and Yuan J (2015). On Graphs with a Unique Perfect Matching, Graphs and Combinatorics, 31:5, (1765-1777), Online publication date: 1-Sep-2015.
  429. Tian Y and Meng J (2015). Restricted Connectivity for Some Interconnection Networks, Graphs and Combinatorics, 31:5, (1727-1737), Online publication date: 1-Sep-2015.
  430. Song J and Yue J (2015). Injective coloring of some graph operations, Applied Mathematics and Computation, 264:C, (279-283), Online publication date: 1-Aug-2015.
  431. ACM
    Soltan S, Yannakakis M and Zussman G (2015). Joint Cyber and Physical Attacks on Power Grids, ACM SIGMETRICS Performance Evaluation Review, 43:1, (361-374), Online publication date: 24-Jun-2015.
  432. ACM
    Soltan S, Yannakakis M and Zussman G Joint Cyber and Physical Attacks on Power Grids Proceedings of the 2015 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, (361-374)
  433. Braga A, de Souza C and Lee O (2015). The Eternal Dominating Set problem for proper interval graphs, Information Processing Letters, 115:6, (582-587), Online publication date: 1-Jun-2015.
  434. Henning M and Southey J (2015). A characterization of the non-trivial diameter two graphs of minimum size, Discrete Applied Mathematics, 187:C, (91-95), Online publication date: 31-May-2015.
  435. ACM
    Järvi J, Foust G and Haveraaen M (2014). Specializing planners for hierarchical multi-way dataflow constraint systems, ACM SIGPLAN Notices, 50:3, (1-10), Online publication date: 12-May-2015.
  436. van Aardt S, Burger A, Dunbar J, Frick M, Llano B, Thomassen C and Zuazua R (2015). Destroying longest cycles in graphs and digraphs, Discrete Applied Mathematics, 186:C, (251-259), Online publication date: 11-May-2015.
  437. Xu C, Zhang S, Ning B and Li B (2015). A note on the number of spanning trees of line digraphs, Discrete Mathematics, 338:5, (688-694), Online publication date: 6-May-2015.
  438. Li H, Li X, Mao Y and Yue J (2015). Note on the spanning-tree packing number of lexicographic product graphs, Discrete Mathematics, 338:5, (669-673), Online publication date: 6-May-2015.
  439. Li B, Ning B, Broersma H and Zhang S (2015). Characterizing Heavy Subgraph Pairs for Pancyclicity, Graphs and Combinatorics, 31:3, (649-667), Online publication date: 1-May-2015.
  440. Li X and Mao Y (2015). Nordhaus-Gaddum-type results for the generalized edge-connectivity of graphs, Discrete Applied Mathematics, 185:C, (102-112), Online publication date: 20-Apr-2015.
  441. ACM
    de Oliveira J, Quiles M, Maia M and Macau E Community detection, with lower time complexity, using coupled Kuramoto oscillators Proceedings of the 30th Annual ACM Symposium on Applied Computing, (1160-1166)
  442. ACM
    Hernández J, Ferber A, Prowell S and Hively L Phase-Space Detection of Cyber Events Proceedings of the 10th Annual Cyber and Information Security Research Conference, (1-4)
  443. Ahn N and Park S (2015). An optimization algorithm for the minimum k-connected m-dominating set problem in wireless sensor networks, Wireless Networks, 21:3, (783-792), Online publication date: 1-Apr-2015.
  444. Wang S and Zhao N (2015). Degree conditions for graphs to be maximally k -restricted edge connected and super k -restricted edge connected, Discrete Applied Mathematics, 184:C, (258-263), Online publication date: 31-Mar-2015.
  445. Fouquet J and Maffray F (2015). Domination, coloring and stability in P 5 -reducible graphs, Discrete Applied Mathematics, 184:C, (122-129), Online publication date: 31-Mar-2015.
  446. Wang L, Zhang X, Zhang Z and Broersma H (2015). A PTAS for the minimum weight connected vertex cover P 3 problem on unit disk graphs, Theoretical Computer Science, 571:C, (58-66), Online publication date: 16-Mar-2015.
  447. Yang Y and Wang S (2015). A note on Hamiltonian paths and cycles with prescribed edges in the 3-ary n-cube, Information Sciences: an International Journal, 296:C, (42-45), Online publication date: 1-Mar-2015.
  448. Wang G, Shi H, Hou F and Bai Y (2015). Some conditional vertex connectivities of complete-transposition graphs, Information Sciences: an International Journal, 295:C, (536-543), Online publication date: 20-Feb-2015.
  449. Neumayer S, Efrat A and Modiano E (2015). Geographic max-flow and min-cut under a circular disk failure model, Computer Networks: The International Journal of Computer and Telecommunications Networking, 77:C, (117-127), Online publication date: 11-Feb-2015.
  450. Jendrol' S and Maceková M (2015). Describing short paths in plane graphs of girth at least 5, Discrete Mathematics, 338:2, (149-158), Online publication date: 6-Feb-2015.
  451. Xiaochuan Zhao and Sayed A (2015). Asynchronous Adaptation and Learning Over Networks—Part II: Performance Analysis, IEEE Transactions on Signal Processing, 63:4, (827-842), Online publication date: 1-Feb-2015.
  452. Li Z, Shao Z, Zhu E and Xu J (2015). A note on local coloring of graphs, Information Processing Letters, 115:2, (302-305), Online publication date: 1-Feb-2015.
  453. Zhou X (2015). A new lower bound for the number of perfect matchings of line graph, Information Processing Letters, 115:2, (269-274), Online publication date: 1-Feb-2015.
  454. Chen X and Li Z (2015). Adjacent-vertex-distinguishing proper edge colorings of planar bipartite graphs with Δ = 9 , 10 , or 11, Information Processing Letters, 115:2, (263-268), Online publication date: 1-Feb-2015.
  455. Wang S, Zhang L and Lin S (2015). k -restricted edge connectivity in ( p + 1 ) -clique-free graphs, Discrete Applied Mathematics, 181:C, (255-259), Online publication date: 30-Jan-2015.
  456. Cai H, Liu H and Lu M (2015). Fault-tolerant maximal local-connectivity on Bubble-sort star graphs, Discrete Applied Mathematics, 181:C, (33-40), Online publication date: 30-Jan-2015.
  457. Tomescu I and Arshad M (2015). On the general sum-connectivity index of connected unicyclic graphs with k pendant vertices, Discrete Applied Mathematics, 181:C, (306-309), Online publication date: 30-Jan-2015.
  458. Knor M, Lužar B and Škrekovski R (2015). Sandwiching the (generalized) Randić index, Discrete Applied Mathematics, 181:C, (160-166), Online publication date: 30-Jan-2015.
  459. Bang-Jensen J, Havet F and Karolinna Maia A (2015). Finding a subdivision of a digraph, Theoretical Computer Science, 562:C, (283-303), Online publication date: 11-Jan-2015.
  460. Gadouleau M and Riis S (2015). Memoryless computation, Theoretical Computer Science, 562:C, (129-145), Online publication date: 11-Jan-2015.
  461. Demasi L and Mohar B Four terminal planar Delta-Wye reducibility via rooted K2,4 minors Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms, (1728-1742)
  462. Schröppel C and Wackerfuß J (2015). Meshing highly regular structures, Journal of Nanomaterials, 16:1, (441-441), Online publication date: 1-Jan-2015.
  463. Zhang W, Zhang G, Gou L, Kong B and Bian D (2015). Delay minimization topology control in planetary surface network, International Journal of Distributed Sensor Networks, 2015, (2-2), Online publication date: 1-Jan-2015.
  464. Lara-Alvarez C, Flores J and Wang C (2015). Detecting the boundary of sensor networks from limited cyclic information, International Journal of Distributed Sensor Networks, 2015, (4-4), Online publication date: 1-Jan-2015.
  465. Wang Y and Xu J (2015). Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph, European Journal of Combinatorics, 43:C, (98-123), Online publication date: 1-Jan-2015.
  466. Couturier J, Golovach P, Kratsch D and Paulusma D (2015). List Coloring in the Absence of a Linear Forest, Algorithmica, 71:1, (21-35), Online publication date: 1-Jan-2015.
  467. Dorbec P, Schiermeyer I, Sidorowicz E and Sopena É (2014). Rainbow connection in oriented graphs, Discrete Applied Mathematics, 179:C, (69-78), Online publication date: 31-Dec-2015.
  468. Holub P, Miller M, Pérez-Rosés H and Ryan J (2014). Degree diameter problem on honeycomb networks, Discrete Applied Mathematics, 179:C, (139-151), Online publication date: 31-Dec-2015.
  469. Hezarkhani B, Slikker M and Van Woensel T (2014). On characterization of the core of lane covering games via dual solutions, Operations Research Letters, 42:8, (505-508), Online publication date: 1-Dec-2014.
  470. ACM
    Xia Y, Zhang L and Tang S Large-Scale Aerial Image Categorization by Multi-Task Discriminative Topologies Discovery Proceedings of the First International Workshop on Internet-Scale Multimedia Management, (53-58)
  471. Wang S and Zhang L (2014). Sufficient conditions for k-restricted edge connected graphs, Theoretical Computer Science, 557:C, (66-75), Online publication date: 6-Nov-2014.
  472. Ma D, Zhu H and He J (2014). $$\lambda $$-numbers of several classes of snarks, Journal of Combinatorial Optimization, 28:4, (787-799), Online publication date: 1-Nov-2014.
  473. Wang X, Song X and Yuan J (2014). On matching cover of graphs, Mathematical Programming: Series A and B, 147:1-2, (499-518), Online publication date: 1-Oct-2014.
  474. Hajiaghayi M, Khandekar R, Kortsarz G and Liaghat V (2014). On a Local Protocol for Concurrent File Transfers, Theory of Computing Systems, 55:3, (613-636), Online publication date: 1-Oct-2014.
  475. ACM
    Järvi J, Foust G and Haveraaen M Specializing planners for hierarchical multi-way dataflow constraint systems Proceedings of the 2014 International Conference on Generative Programming: Concepts and Experiences, (1-10)
  476. Li J, Wang S and Yang Y (2014). Panconnectivity and pancyclicity of the 3-ary n-cube network under the path restrictions, Applied Mathematics and Computation, 243, (339-348), Online publication date: 1-Sep-2014.
  477. ACM
    Censor-Hillel K, Ghaffari M and Kuhn F Distributed connectivity decomposition Proceedings of the 2014 ACM symposium on Principles of distributed computing, (156-165)
  478. Gao X (2014). Regularity index of uncertain graph, Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology, 27:4, (1671-1678), Online publication date: 1-Jul-2014.
  479. Mazzuoccolo G and Ruini B (2014). Upper Bounds for the Automorphic Chromatic Index of a Graph, Graphs and Combinatorics, 30:4, (963-975), Online publication date: 1-Jul-2014.
  480. Li H, Li X, Sun Y and Zhao Y (2014). Note on Minimally d-Rainbow Connected Graphs, Graphs and Combinatorics, 30:4, (949-955), Online publication date: 1-Jul-2014.
  481. Crowston R, Fellows M, Gutin G, Jones M, Kim E, Rosamond F, Ruzsa I, Thomassé S and Yeo A (2014). Satisfying more than half of a system of linear equations over GF(2), Journal of Computer and System Sciences, 80:4, (687-696), Online publication date: 1-Jun-2014.
  482. Wang S, Zhang S and Yang Y (2014). Hamiltonian path embeddings in conditional faulty k-ary n-cubes, Information Sciences: an International Journal, 268, (463-488), Online publication date: 1-Jun-2014.
  483. Kaiser T, Stehlík M and Škrekovski R (2014). Replication in critical graphs and the persistence of monomial ideals, Journal of Combinatorial Theory Series A, 123:1, (239-251), Online publication date: 1-Apr-2014.
  484. Yang F, Chen X and Ma C (2014). On the vertex-distinguishing proper edge coloring of composition of complete graph and star, Information Processing Letters, 114:4, (217-221), Online publication date: 1-Apr-2014.
  485. Orellana R and Scott G (2014). Graphs with equal chromatic symmetric functions, Discrete Mathematics, 320, (1-14), Online publication date: 1-Apr-2014.
  486. Campos V, Klein S, Sampaio R and Silva A (2014). Fixed-parameter algorithms for the cocoloring problem, Discrete Applied Mathematics, 167, (52-60), Online publication date: 1-Apr-2014.
  487. Ryjáček Z and Vrána P (2014). A Closure for 1-Hamilton-Connectedness in Claw-Free Graphs, Journal of Graph Theory, 75:4, (358-376), Online publication date: 1-Apr-2014.
  488. Bang-Jensen J and Bessy S (2014). (Arc-)disjoint flows in networks, Theoretical Computer Science, 526, (28-40), Online publication date: 1-Mar-2014.
  489. Caro Y and Lauri J (2014). Non-monochromatic non-rainbow colourings of σ-hypergraphs, Discrete Mathematics, 318, (96-104), Online publication date: 1-Mar-2014.
  490. Song H, Fan S, Chen Y, Sun L and Lai H (2014). On r-hued coloring of K4-minor free graphs, Discrete Mathematics, 315-316, (47-52), Online publication date: 1-Feb-2014.
  491. Tomescu I and Kanwal S (2014). Unicyclic graphs of given girth k≥4 having smallest general sum-connectivity index, Discrete Applied Mathematics, 164, (344-348), Online publication date: 1-Feb-2014.
  492. Alcón L (2014). On asteroidal sets in chordal graphs, Discrete Applied Mathematics, 164, (482-491), Online publication date: 1-Feb-2014.
  493. Malyshev D (2014). Boundary graph classes for some maximum induced subgraph problems, Journal of Combinatorial Optimization, 27:2, (345-354), Online publication date: 1-Feb-2014.
  494. Kung T, Lin C and Hsu L (2014). On the maximum number of fault-free mutually independent Hamiltonian cycles in the faulty hypercube, Journal of Combinatorial Optimization, 27:2, (328-344), Online publication date: 1-Feb-2014.
  495. Thomson A and Zhou S (2014). Rotational circulant graphs, Discrete Applied Mathematics, 162:C, (296-305), Online publication date: 10-Jan-2014.
  496. Petrie C (2014). ( F , I ) -security in graphs, Discrete Applied Mathematics, 162:C, (285-295), Online publication date: 10-Jan-2014.
  497. Petrie C (2014). (F,I)-security in graphs, Discrete Applied Mathematics, 162, (285-295), Online publication date: 1-Jan-2014.
  498. Alamdari S, Fata E and Smith S (2014). Persistent monitoring in discrete environments, International Journal of Robotics Research, 33:1, (138-154), Online publication date: 1-Jan-2014.
  499. Macgillivray G, Raspaud A and Swarts J (2014). Obstructions to locally injective oriented improper colourings, European Journal of Combinatorics, 35, (402-412), Online publication date: 1-Jan-2014.
  500. Liu Z, Wang C and Wang J (2014). Aggregate nearest neighbor queries in uncertain graphs, World Wide Web, 17:1, (161-188), Online publication date: 1-Jan-2014.
  501. Wang R and Wang S (2013). A sufficient condition for graphs to be λk-optimal, Discrete Applied Mathematics, 161:18, (3048-3053), Online publication date: 1-Dec-2013.
  502. Langenhan C, Weber M, Liwicki M, Petzold F and Dengel A (2013). Graph-based retrieval of building information models for supporting the early design stages, Advanced Engineering Informatics, 27:4, (413-426), Online publication date: 1-Oct-2013.
  503. Feng Y and Lin W (2013). A concise proof for total coloring subcubic graphs, Information Processing Letters, 113:18, (664-665), Online publication date: 1-Sep-2013.
  504. Khoshkhah K, Nemati M, Soltani H and Zaker M (2013). A Study of Monopolies in Graphs, Graphs and Combinatorics, 29:5, (1417-1427), Online publication date: 1-Sep-2013.
  505. Li X and Shi Y (2013). Rainbow Connection in 3-Connected Graphs, Graphs and Combinatorics, 29:5, (1471-1475), Online publication date: 1-Sep-2013.
  506. Gao Y, Li G and Yan J (2013). Neighborhood Unions for the Existence of Disjoint Chorded Cycles in Graphs, Graphs and Combinatorics, 29:5, (1337-1345), Online publication date: 1-Sep-2013.
  507. Chen L, Li X and Lian H (2013). Nordhaus---Gaddum-Type Theorem for Rainbow Connection Number of Graphs, Graphs and Combinatorics, 29:5, (1235-1247), Online publication date: 1-Sep-2013.
  508. Auger D, Charon I, Hudry O and Lobstein A (2013). Watching systems in graphs, Discrete Applied Mathematics, 161:12, (1674-1685), Online publication date: 1-Aug-2013.
  509. Schiermeyer I (2013). Rainbow connection and minimum degree, Discrete Applied Mathematics, 161:12, (1784-1787), Online publication date: 1-Aug-2013.
  510. Chen G and Shan S (2013). Homeomorphically irreducible spanning trees, Journal of Combinatorial Theory Series B, 103:4, (409-414), Online publication date: 1-Jul-2013.
  511. Hu X and Liu H (2013). The (conditional) matching preclusion for burnt pancake graphs, Discrete Applied Mathematics, 161:10-11, (1481-1489), Online publication date: 1-Jul-2013.
  512. Artigas D, Dantas S, Dourado M, Szwarcfiter J and Yamaguchi S (2013). On the contour of graphs, Discrete Applied Mathematics, 161:10-11, (1356-1362), Online publication date: 1-Jul-2013.
  513. Hoffmann-Ostenhof A (2013). A Note on 5-Cycle Double Covers, Graphs and Combinatorics, 29:4, (977-979), Online publication date: 1-Jul-2013.
  514. Okamura H and Yamashita T (2013). Degree Sum Conditions for Cyclability in Bipartite Graphs, Graphs and Combinatorics, 29:4, (1077-1085), Online publication date: 1-Jul-2013.
  515. Busch A, Jacobson M, Morris T, Plantholt M and Tipnis S (2013). Improved Sufficient Conditions for the Existence of Anti-Directed Hamiltonian Cycles in Digraphs, Graphs and Combinatorics, 29:3, (359-364), Online publication date: 1-May-2013.
  516. Lo A and MarkströM K (2013). Minimum codegree threshold for (K43-e)-factors, Journal of Combinatorial Theory Series A, 120:3, (708-721), Online publication date: 1-Apr-2013.
  517. Schmidt J (2013). A simple test on 2-vertex- and 2-edge-connectivity, Information Processing Letters, 113:7, (241-244), Online publication date: 1-Apr-2013.
  518. Araujo J, Campos V, Giroire F, Nisse N, Sampaio L and Soares R (2013). On the hull number of some graph classes, Theoretical Computer Science, 475, (1-12), Online publication date: 1-Mar-2013.
  519. Schiermeyer I (2013). On minimally rainbow k-connected graphs, Discrete Applied Mathematics, 161:4-5, (702-705), Online publication date: 1-Mar-2013.
  520. Akbari S and Oboudi M (2013). On the edge cover polynomial of a graph, European Journal of Combinatorics, 34:2, (297-321), Online publication date: 1-Feb-2013.
  521. ACM
    Choi J, Seo H and Lee C An integer linear programming (ILP)-based optimization for finding the optimal independent sets in wireless ad hoc networks Proceedings of the 7th International Conference on Ubiquitous Information Management and Communication, (1-5)
  522. Li X and Zhou S (2013). Labeling outerplanar graphs with maximum degree three, Discrete Applied Mathematics, 161:1-2, (200-211), Online publication date: 1-Jan-2013.
  523. Che Z and Chen Z (2013). Forcing faces in plane bipartite graphs (II), Discrete Applied Mathematics, 161:1-2, (71-80), Online publication date: 1-Jan-2013.
  524. Liang M and Liu B (2013). On the Randić index and girth of graphs, Discrete Applied Mathematics, 161:1-2, (212-216), Online publication date: 1-Jan-2013.
  525. Deng J, Chen F and Jin L (2013). Dimensions of biquadratic spline spaces over T-meshes, Journal of Computational and Applied Mathematics, 238, (68-94), Online publication date: 1-Jan-2013.
  526. Vaughan E (2013). An Asymptotic Version of the Multigraph 1-Factorization Conjecture, Journal of Graph Theory, 72:1, (19-29), Online publication date: 1-Jan-2013.
  527. Pedersen A (2012). Hadwiger's Conjecture and inflations of the Petersen graph, Discrete Mathematics, 312:24, (3537-3543), Online publication date: 28-Dec-2012.
  528. Ko K and Park H (2012). Characteristics of Graph Braid Groups, Discrete & Computational Geometry, 48:4, (915-963), Online publication date: 1-Dec-2012.
  529. Li J, Sonmez A, Cataltepe Z and Bax E Validation of network classifiers Proceedings of the 2012 Joint IAPR international conference on Structural, Syntactic, and Statistical Pattern Recognition, (448-457)
  530. Li P, Lai H and Liang Y (2012). Characterization of removable elements with respect to having k disjoint bases in a matroid, Discrete Applied Mathematics, 160:16-17, (2445-2451), Online publication date: 1-Nov-2012.
  531. Li S and Li X (2012). Note on the hardness of generalized connectivity, Journal of Combinatorial Optimization, 24:3, (389-396), Online publication date: 1-Oct-2012.
  532. Huang Y, Chiang C, Huang L and Yeh H (2012). On L(2,1)-labeling of generalized Petersen graphs, Journal of Combinatorial Optimization, 24:3, (266-279), Online publication date: 1-Oct-2012.
  533. ACM
    Järvi J, Haveraaen M, Freeman J and Marcus M Expressing multi-way data-flow constraint systems as a commutative monoid makes many of their properties obvious Proceedings of the 8th ACM SIGPLAN workshop on Generic programming, (25-32)
  534. Hernández-Cruz C and Galeana-Sánchez H (2012). k -kernels in k -transitive and k -quasi-transitive digraphs, Discrete Mathematics, 312:16, (2522-2530), Online publication date: 28-Aug-2012.
  535. Liang M and Liu B (2012). A proof of two conjectures on the Randić index and the average eccentricity, Discrete Mathematics, 312:16, (2446-2449), Online publication date: 28-Aug-2012.
  536. Cameron P and Gadouleau M (2012). Remoteness of permutation codes, European Journal of Combinatorics, 33:6, (1273-1285), Online publication date: 1-Aug-2012.
  537. Schmidt J Certifying 3-connectivity in linear time Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I, (786-797)
  538. LéVêQue B, Maffray F and Trotignon N (2012). On graphs with no induced subdivision of K4, Journal of Combinatorial Theory Series B, 102:4, (924-947), Online publication date: 1-Jul-2012.
  539. Shu J, Zhang C and Zhang T (2012). Flows and parity subgraphs of graphs with large odd-edge-connectivity, Journal of Combinatorial Theory Series B, 102:4, (839-851), Online publication date: 1-Jul-2012.
  540. Blackburn S, Stinson D and Upadhyay J (2012). On the complexity of the herding attack and some related attacks on hash functions, Designs, Codes and Cryptography, 64:1-2, (171-193), Online publication date: 1-Jul-2012.
  541. ACM
    Adamaszek M and Stacho J Algorithmic complexity of finding cross-cycles in flag complexes Proceedings of the twenty-eighth annual symposium on Computational geometry, (51-60)
  542. Chiba S, Fujisawa J, Tsugaki M and Yamashita T (2012). Long cycles in unbalanced bipartite graphs, Discrete Mathematics, 312:11, (1857-1862), Online publication date: 1-Jun-2012.
  543. Chen Y, Fan S, Lai H, Song H and Sun L (2012). On dynamic coloring for planar graphs and graphs of higher genus, Discrete Applied Mathematics, 160:7-8, (1064-1071), Online publication date: 1-May-2012.
  544. Grigoriev A, Marchal B, Usotskaya N and Todinca I (2012). A note on planar graphs with large width parameters and small grid-minors, Discrete Applied Mathematics, 160:7-8, (1262-1269), Online publication date: 1-May-2012.
  545. Fister I, Fister I and Brest J A hybrid artificial bee colony algorithm for graph 3-coloring Proceedings of the 2012 international conference on Swarm and Evolutionary Computation, (66-74)
  546. Bevacqua A, Carnuccio M, Cuzzocrea A, Ortale R and Ritacco E Enforcing interaction and cooperation in content-based web3.0 applications Proceedings of the 14th Asia-Pacific international conference on Web Technologies and Applications, (472-483)
  547. Spillner A, Nguyen B and Moulton V (2012). Constructing and Drawing Regular Planar Split Networks, IEEE/ACM Transactions on Computational Biology and Bioinformatics, 9:2, (395-407), Online publication date: 1-Mar-2012.
  548. Golovach P, Paulusma D and Song J 4-coloring h-free graphs when h is small Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science, (289-300)
  549. Zhang X and Zhang C (2012). Kotzig frames and circuit double covers, Discrete Mathematics, 312:1, (174-180), Online publication date: 1-Jan-2012.
  550. Boella M, Romani F, Al-Raies A, Solimando C and Lancioni G The SALAH project Proceedings of the 7th Asia conference on Information Retrieval Technology, (538-549)
  551. Sheng P and Wang Y (2011). On acyclic edge coloring of planar graphs without intersecting triangles, Discrete Mathematics, 311:21, (2490-2495), Online publication date: 1-Nov-2011.
  552. Fan H, Kierstead H, Liu G, Molla T, Wu J and Zhang X (2011). A note on relaxed equitable coloring of graphs, Information Processing Letters, 111:21-22, (1062-1066), Online publication date: 1-Nov-2011.
  553. Csikvári P and Oboudi M (2011). On the roots of edge cover polynomials of graphs, European Journal of Combinatorics, 32:8, (1407-1416), Online publication date: 1-Nov-2011.
  554. Czap J (2011). Parity vertex coloring of outerplane graphs, Discrete Mathematics, 311:21, (2570-2573), Online publication date: 1-Nov-2011.
  555. ACM
    De Virgilio R and Milicchio F RFID data analysis using tensor calculus for supply chain management Proceedings of the 20th ACM international conference on Information and knowledge management, (1743-1748)
  556. ACM
    Bevacqua A, Carnuccio M, Ortale R and Ritacco E A new architectural paradigm for content-based web applications Proceedings of the 15th Symposium on International Database Engineering & Applications, (192-196)
  557. Knap T and Mlýnková I Web quality assessment model Proceedings of the 8th international conference on Ubiquitous intelligence and computing, (252-266)
  558. Alpern S, Morton A and Papadaki K (2011). Patrolling Games, Operations Research, 59:5, (1246-1257), Online publication date: 1-Sep-2011.
  559. Artigas D, Dantas S, Dourado M and Szwarcfiter J (2011). Partitioning a graph into convex sets, Discrete Mathematics, 311:17, (1968-1977), Online publication date: 1-Sep-2011.
  560. Xiong L (2011). Closure operation for even factors on claw-free graphs, Discrete Mathematics, 311:16, (1714-1723), Online publication date: 28-Aug-2011.
  561. Golovach P, Paulusma D and Song J Coloring graphs without short cycles and long induced paths Proceedings of the 18th international conference on Fundamentals of computation theory, (193-204)
  562. Wu Q, Lu Q and Wang Y (2011). (Δ+1)-total-colorability of plane graphs of maximum degree Δ≥6 with neither chordal 5-cycle nor chordal 6-cycle, Information Processing Letters, 111:15, (767-772), Online publication date: 1-Aug-2011.
  563. Xu Y (2011). On acyclic edge coloring of toroidal graphs, Information Processing Letters, 111:13, (647-649), Online publication date: 1-Jul-2011.
  564. Golovach P and Paulusma D List coloring in the absence of a linear forest Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science, (119-130)
  565. ACM
    Hajiaghayi M, Khandekar R, Kortsarz G and Liaghat V On a local protocol for concurrent file transfers Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures, (269-278)
  566. Olsson C and Enqvist O Stable structure from motion for unordered image collections Proceedings of the 17th Scandinavian conference on Image analysis, (524-535)
  567. Eschen E, Hoíng C, Spinrad J and Sritharan R (2011). On graphs without a C4 or a diamond, Discrete Applied Mathematics, 159:7, (581-587), Online publication date: 1-Apr-2011.
  568. Pedersen A, Rautenbach D and Regen F (2011). Lower bounds on the independence number of certain graphs of odd girth at least seven, Discrete Applied Mathematics, 159:2-3, (143-151), Online publication date: 1-Jan-2011.
  569. Yu G, Miao Z and Shu J Bases of primitive nonpowerful sign patterns Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I, (114-127)
  570. Nitinawarat S, Ye C, Barg A, Narayan P and Reznik A (2010). Secret key generation for a pairwise independent network model, IEEE Transactions on Information Theory, 56:12, (6482-6489), Online publication date: 1-Dec-2010.
  571. Korada S, Şaşoǧlu E and Urbanke R (2010). Polar codes, IEEE Transactions on Information Theory, 56:12, (6253-6264), Online publication date: 1-Dec-2010.
  572. Barát J and Kriesell M (2010). What is on his mind?, Discrete Mathematics, 310:20, (2573-2583), Online publication date: 1-Oct-2010.
  573. Flandrin E, Gyri E, Li H and Shu J (2010). Cyclability in k-connected K1,4-free graphs, Discrete Mathematics, 310:20, (2735-2741), Online publication date: 1-Oct-2010.
  574. Matos Camacho S, Schiermeyer I and Tuza Z (2010). Approximation algorithms for the minimum rainbow subgraph problem, Discrete Mathematics, 310:20, (2666-2670), Online publication date: 1-Oct-2010.
  575. Caragiannis I, Ferreira A, Kaklamanis C, Pérennes S and Rivano H (2010). Fractional Path Coloring in Bounded Degree Trees with Applications, Algorithmica, 58:2, (516-540), Online publication date: 1-Oct-2010.
  576. ACM
    Hamed Azimi N, Gupta H, Hou X and Gao J Data preservation under spatial failures in sensor networks Proceedings of the eleventh ACM international symposium on Mobile ad hoc networking and computing, (171-180)
  577. Hoffman D, Chang C, Bazdell G, Stevens B and Yoo K Bad pairs in software testing Proceedings of the 5th international academic and industrial conference on Testing - practice and research techniques, (39-55)
  578. Birgin E and Gentil J (2010). New and improved results for packing identical unitary radius circles within triangles, rectangles and strips, Computers and Operations Research, 37:7, (1318-1327), Online publication date: 1-Jul-2010.
  579. Broersma H, Golovach P, Paulusma D and Song J Narrowing down the gap on the complexity of coloring Pk-free graphs Proceedings of the 36th international conference on Graph-theoretic concepts in computer science, (63-74)
  580. Gourvès L, Lyra A, Martinhon C and Monnot J Complexity of paths, trails and circuits in arc-colored digraphs Proceedings of the 7th annual conference on Theory and Applications of Models of Computation, (222-233)
  581. Iradmusa M (2010). On colorings of graph fractional powers, Discrete Mathematics, 310:10-11, (1551-1556), Online publication date: 1-Jun-2010.
  582. Dourado M, Protti F and Szwarcfiter J (2010). Complexity results related to monophonic convexity, Discrete Applied Mathematics, 158:12, (1268-1274), Online publication date: 1-Jun-2010.
  583. Chiarandini M and Stützle T An analysis of heuristics for vertex colouring Proceedings of the 9th international conference on Experimental Algorithms, (326-337)
  584. Abreu M, Balbuena C and Labbate D (2010). Adjacency matrices of polarity graphs and of other C4-free graphs of large size, Designs, Codes and Cryptography, 55:2-3, (221-233), Online publication date: 1-May-2010.
  585. Csorba P (2010). Homotopy types of box complexes of chordal graphs, European Journal of Combinatorics, 31:3, (861-866), Online publication date: 1-Apr-2010.
  586. Aghagolzadeh M, Eldawlatly S and Oweiss K (2010). Synergistic coding by cortical neural ensembles, IEEE Transactions on Information Theory, 56:2, (875-889), Online publication date: 1-Feb-2010.
  587. Pedersen A and Toft B (2010). A basic elementary extension of the Duchet-Meyniel theorem, Discrete Mathematics, 310:3, (480-488), Online publication date: 1-Feb-2010.
  588. Alon N, Gutin G, Kim E, Szeider S and Yeo A Solving MAX-r-SAT above a tight lower bound Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete algorithms, (511-517)
  589. Banerjee S, Chowdhury A and Ghosh S Video surveillance with PTZ cameras Proceedings of the 11th international conference on Distributed computing and networking, (341-352)
  590. van Steen M and Pierre G Replicating for performance Replication, (73-89)
  591. Han C, Li Y and Yang Y Compatibility between optimal tree-based broadcast routing and metric design Proceedings of the 28th IEEE conference on Global telecommunications, (1517-1522)
  592. Ghosh S and Sinha K On convex greedy embedding conjecture for 3-connected planar graphs Proceedings of the 17th international conference on Fundamentals of computation theory, (145-156)
  593. Lin S and Wang S (2009). Super p-restricted edge connectivity of line graphs, Information Sciences: an International Journal, 179:18, (3122-3126), Online publication date: 1-Aug-2009.
  594. Li X and Liu J (2009). A proof of a conjecture on the Randić index of graphs with given girth, Discrete Applied Mathematics, 157:15, (3332-3335), Online publication date: 1-Aug-2009.
  595. ACM
    Mathieu C and Sinclair A Sherali-adams relaxations of the matching polytope Proceedings of the forty-first annual ACM symposium on Theory of computing, (293-302)
  596. ACM
    Huang Y, Wen K, Lin L, Xu L and Hsieh S Component Fault Diagnosability of Hierarchical Cubic Networks, ACM Transactions on Design Automation of Electronic Systems, 0:0
  597. Cohen R and Cassuto Y Placement and read algorithms for high throughput in coded network switches 2016 IEEE International Symposium on Information Theory (ISIT), (250-254)
  598. Zhang Z, Zhou J, Mo Y and Du D Performance-guaranteed approximation algorithm for fault-tolerant connected dominating set in wireless networks IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications, (1-8)
Contributors
  • Sorbonne University
  • University of Waterloo

Recommendations