My reviews

For MathSciNet

• MR5070222: Arnau Messegué, Josep M. Miret and Anita A. Sillasen, On the nonexistence of almost Moore digraphs with self-repeats, The Electronic Journal of Combinatorics 33 (2026), no. 2, Paper No. 2.27, 19 pp.
• MR5059051: Zilong Yan and Yuejian Peng, A strong structural stability of \(C_{2k+1}\)-free graphs, Journal of Graph Theory 112 (2026), 151–160.
• MR5045615: Toshiki Abe and Kenta Ozeki, List orientation number of graphs, Discrete Applied Mathematics 387 (2026), 225–233.
• MR5029914: Yiting Jiang, Huijuan Xu, Xinbo Xu and Xuding Zhu, Degree-truncated choice number of planar graphs, Discrete Mathematics 349 (2026), no. 7, Paper No. 115035, 15 pp.
• MR5016677: Dehai Liu, Kaishun Wang and Tian Yao, \(s\)-almost cross-\(t\)-intersecting families for finite sets, Discrete Mathematics 349 (2026), no. 6, Paper No. 114982, 18 pp.
• MR4998094: Yongjiang Wu, Zhiyi Liu, Lihua Feng and Yongtao Li, Two results on set families: sturdiness and intersection, Journal of Combinatorial Theory. Series A 220 (2026), Paper No. 106153, 14 pp.
• MR4985149: Bing Wang, Wenwen Chen and Ping Zhang, Non-\(r\)-partite graphs without complete split subgraphs, Discrete Mathematics 349 (2026), no. 3, Paper No. 114882, 10 pp.
• MR4946075: Peter Frankl and Jian Wang, Intersection-union families, Journal of Combinatorial Theory. Series A 217 (2026), Paper No. 106100, 23 pp.
• MR4943490: Edy T. Baskoro, Arnau Messegué and Josep M. Miret, New results regarding the permutation cycle structure of almost Moore digraphs, Discrete Mathematics Letters 16 (2025), 1–7.
• MR4936459: Zeyuan Wu, Hongzhang Chen and Jianxi Li, The size and the spectral radius of a saturated non-covered graph, Discrete Applied Mathematics 377 (2025), 343–349.
• MR4923771: Cristina Dalfó, Grahame Erskine, Geoffrey Exoo, Miquel Àngel Fiol and James Tuite, On bipartite \((1, 1, k)\)-mixed graphs, The Art of Discrete and Applied Mathematics 8 (2025), no. 3, Paper No. P3.08, 24 pp.
• MR4908030: Xin Xu and Jiawei Shao, The planar Turán number of double star \(S_{2,4}\), Discrete Mathematics 348 (2025), no. 11, Paper No. 114571, 8 pp.
• MR4878762: Zhenzhen Lou, Lu Lu and Mingqing Zhai, A refinement on spectral Mantel's theorem, European Journal of Combinatorics 127 (2025), Paper No. 104142, 14 pp.
• MR4815868: Jesse Geneson and Shen-Fu Tsai, Extremal bounds for pattern avoidance in multidimensional 0-1 matrices, Discrete Mathematics 348 (2025), no. 2, Paper No. 114303, 18 pp.
• MR4788452: Asaf Cohen Antonir and Asaf Shapira, Bounding the number of odd paths in planar graphs via convex optimization, Journal of Graph Theory 107 (2024), no. 2, 330–343.
• MR4773115: Imre Leader, Žarko Ranđelović and Ta Sheng Tan, A note on Hamiltonian-intersecting families of graphs, Discrete Mathematics 347 (2024), no. 11, Paper No. 114160, 4 pp.
• MR4734698: Carlos Vilchis-Alfaro and Hortensia Galeana-Sánchez, Trails in arc-colored digraphs avoiding forbidden transitions, Discrete Mathematics Letters 13 (2024), 6–12.
• MR4565201: Weilun Xu and Xia Zhang, On the chromatic number of \((P_5, dart)\)-free graphs, Discrete Mathematics, Algorithms and Applications 15 (2023), no. 3, Paper No. 2250090, 8 pp.

For zbMATH Open

• Zbl 08207624: Carole Porrier, Alain Goupil and Alexandre Blondin Massé, The leaf function of Penrose P2 graphs, Discrete Mathematics and Theoretical Computer Science 27 (2026), no. 3, Paper No. 9, 25 pp.
• Zbl 08196441: Zejun Huang and Zhenhua Lyu, Extremal digraphs containing at most \(t\) paths of length 2 with the same endpoints, Discrete Applied Mathematics 388 (2026), 1–10.
• Zbl 08184176: Zakir Deniz, On 2-distance \((\Delta + 4)\)-coloring of planar graphs with girth five, Acta Mathematicae Applicatae Sinica. English Series 42 (2026), no. 2, 569–581.
• Zbl 1586.05041: H. W. Willie Wong and E. G. Tay, Extensions of Moon's and Bagga and Beineke's theorems on dicycle and score (outdegree) structures of tournaments, Graphs and Combinatorics 42 (2026), no. 1, Paper No. 6, 18 pp.
• Zbl 1581.05135: Bijo S. Anand, Arun Anil, Manoj Changat, Prasanth G. Narasimha-Shenoi and Sabeer S. Ramla, Carathéodory number and exchange number in \(\Delta\)-convexity, Journal of Combinatorial Mathematics and Combinatorial Computing 126 (2025), 11–27.
• Zbl 1573.05144: Bin Chen, Extremal results on disjoint cycles in tournaments and bipartite tournaments, Journal of Graph Theory 110 (2025), no. 1, 111–121.
• Zbl 1569.05117: Jiawen Bo, Zhipeng Gao, Xiaopan Lian and Jianing Liu, Some digraph classes that meet the directed path partition conjecture, Discrete Applied Mathematics 372 (2025), 260–267.
• Zbl 1568.05003: Santosh Kumar Yadav, Advanced Graph Theory. Springer, Cham (2023).
• Zbl 1535.05131: Chris Florez, Jonathan Higgins, Kyle Huang, Thomas Michael Keller and Dawei Shen, The adjacency spectra of some families of minimally connected prime graphs, Involve 17 (2024), no. 1, 107–120.
• Zbl 1533.05137: Zhilan Wang, Yuzhen Qi and Jin Yan, Vertex-disjoint cycles of the same length in tournaments, Journal of Graph Theory 102 (2023), no. 4, 666–683.
• Zbl 1522.05072: Pat Morin, A fast algorithm for the product structure of planar graphs, Algorithmica 83 (2021), no. 5, 1544–1558.
• Zbl 1512.05281: Alberto Seeger and David Sossa, Vertex-removal, vertex-addition and different notions of similarity for vertices of a graph, Linear and Multilinear Algebra 70 (2022), no. 20, 5173–5192.
• Zbl 1504.05199: Martín D. Safe, Essential obstacles to Helly circular-arc graphs, Discrete Applied Mathematics 320 (2022), 245–258.
• Zbl 1494.05058: Dániel Gerbner and Cory Palmer, Some exact results for generalized Turán problems, European Journal of Combinatorics 103 (2022), Paper No. 103519, 13 pp.
• Zbl 1487.05100: S. Shyama and M. R. Chithra, Total chromatic number of honeycomb network, Journal of Discrete Mathematical Sciences and Cryptography 24 (2021), no. 4, 931–937.

Hard-to-find papers

I maintain personal copies of a few papers that are difficult to obtain through standard channels. If you would like a copy of any of the following, please email me and I'll be happy to share.

• Herbert Grötzsch, Zur Theorie der diskreten Gebilde. 7. Mitteilung: Ein Dreifarbensatz für dreikreisfreie Netze auf der Kugel, Wissenschaftliche Zeitschrift der Martin-Luther-Universität Halle-Wittenberg. Mathematisch-Naturwissenschaftliche Reihe 8 (Nov. 1958), no. 1, 109–120 (German). [MR0116320, Zbl 0089.39506]
• Víctor Neumann Lara, Seminúcleos de una digráfica [Seminuclei of a digraph], Anales del Instituto de Matemáticas (Universidad Nacional Autónoma de México) 11 (1971), 55–62 (Spanish). [MR0317987, Zbl 0286.05113]
• V. I. Arnautov, Ocenka chisla vneshnej ustojchivosti grafa s pomoshh'ju minimal'noj stepeni vershin [Estimation of the exterior stability number of a graph by means of the minimal degree of the vertices], Prikladnaya matematika i programmirovanie (Institut matematiki s Vychislitel'nym tsentrom AN MSSR) 11 (1974), 3–8 (Russian). [MR0340103, Zbl 0297.05131]
  В. И. Арнаутов, «Оценка числа внешней устойчивости графа с помощью минимальной степени вершин», Прикладная математика и программирование (Институт математики с Вычислительным центром АН МССР) 11 (1974), 3–8.
• V. G. Vizing, Raskraska vershin grafa v predpisannye cveta [Coloring the vertices of a graph in prescribed colors], Metody diskretnogo analiza v teorii kodov i shem (Novosibirsk: Institut matematiki SO AN SSSR) 29 (1976), 3–10 (Russian). [MR0498216, Zbl 0362.05060] A retypeset version is also available on request.
  В. Г. Визинг, «Раскраска вершин графа в предписанные цвета», Методы дискретного анализа в теории кодов и схем (Новосибирск: Институт математики СО АН СССР) 29 (1976), 3–10.
• Seiya Negami, Classification of 6-regular Klein-bottlal graphs, Research Reports on Information Sciences A: Mathematical Science, No. A-96, Department of Information Sciences, Tokyo Institute of Technology (Oct. 1984), 16 pages.
• Maryam Mirzakhani, A small non-4-choosable planar graph, Bulletin of the Institute of Combinatorics and its Applications 17 (1996), 15–18. [MR1386951, Zbl 0860.05029] A retypeset version is also available on request.