My reviews

For MathSciNet

• MR5029914: Jiang, Yiting; Xu, Huijuan; Xu, Xinbo; Zhu, Xuding. Degree-truncated choice number of planar graphs. Discrete Mathematics 349 (2026), no. 7, Paper No. 115035, 15 pp.
• MR5016677: Liu, Dehai; Wang, Kaishun; Yao, Tian. \(s\)-almost cross-\(t\)-intersecting families for finite sets. Discrete Mathematics 349 (2026), no. 6, Paper No. 114982, 18 pp.
• MR4946075: Frankl, Peter; Wang, Jian. Intersection-union families. Journal of Combinatorial Theory, Series A 217 (2026), Paper No. 106100, 23 pp.
• MR4985149: Wang, Bing; Chen, Wenwen; Zhang, Ping. Non-\(r\)-partite graphs without complete split subgraphs. Discrete Mathematics 349 (2026), no. 3, Paper No. 114882, 10 pp.
• MR4943490: Baskoro, Edy T.; Messegué, Arnau; Miret, Josep M. New results regarding the permutation cycle structure of almost Moore digraphs. Discrete Mathematics Letters 16 (2025), 1–7.
• MR4936459: Wu, Zeyuan; Chen, Hongzhang; Li, Jianxi. The size and the spectral radius of a saturated non-covered graph. Discrete Applied Mathematics 377 (2025), 343–349.
• MR4923771: Dalfó, Cristina; Erskine, Grahame; Exoo, Geoffrey; Fiol, Miquel Àngel; Tuite, James. 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: Xu, Xin; Shao, Jiawei. The planar Turán number of double star \(S_{2,4}\). Discrete Mathematics 348 (2025), no. 11, Paper No. 114571, 8 pp.
• MR4878762: Lou, Zhenzhen; Lu, Lu; Zhai, Mingqing. A refinement on spectral Mantel's theorem. European Journal of Combinatorics 127 (2025), Paper No. 104142, 14 pp.
• MR4815868: Geneson, Jesse; Tsai, Shen-Fu. Extremal bounds for pattern avoidance in multidimensional 0-1 matrices. Discrete Mathematics 348 (2025), no. 2, Paper No. 114303, 18 pp.
• MR4788452: Antonir, Asaf Cohen; Shapira, Asaf. Bounding the number of odd paths in planar graphs via convex optimization. Journal of Graph Theory 107 (2024), no. 2, 330–343.
• MR4773115: Leader, Imre; Ranđelović, Žarko; Tan, Ta Sheng. A note on Hamiltonian-intersecting families of graphs. Discrete Mathematics 347 (2024), no. 11, Paper No. 114160, 4 pp.
• MR4734698: Vilchis-Alfaro, Carlos; Galeana-Sánchez, Hortensia. Trails in arc-colored digraphs avoiding forbidden transitions. Discrete Mathematics Letters 13 (2024), 6–12.
• MR4565201: Xu, Weilun; Zhang, Xia. On the chromatic number of \((P_5, \mathrm{dart})\)-free graphs. Discrete Mathematics, Algorithms and Applications 15 (2023), no. 3, Paper No. 2250090, 8 pp.

For zbMATH Open

• Zbl 08196441: Huang, Zejun; Lyu, Zhenhua. Extremal digraphs containing at most \(t\) paths of length 2 with the same endpoints. Discrete Applied Mathematics 388 (2026), 1–10.
• Zbl 08184176: Deniz, Zakir. 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 08145829: Wong, H. W. Willie; Tay, E. G. 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 08101858: Anand, Bijo S.; Anil, Arun; Changat, Manoj; Narasimha-Shenoi, Prasanth G.; Ramla, Sabeer S. Carathéodory number and exchange number in \(\Delta\)-convexity. Journal of Combinatorial Mathematics and Combinatorial Computing 126 (2025), 11–27.
• Zbl 1573.05144: Chen, Bin. Extremal results on disjoint cycles in tournaments and bipartite tournaments. Journal of Graph Theory 110 (2025), no. 1, 111–121.
• Zbl 1569.05117: Bo, Jiawen; Gao, Zhipeng; Lian, Xiaopan; Liu, Jianing. Some digraph classes that meet the directed path partition conjecture. Discrete Applied Mathematics 372 (2025), 260–267.
• Zbl 1568.05003: Yadav, Santosh Kumar. Advanced Graph Theory. Springer, Cham (2023).
• Zbl 1535.05131: Florez, Chris; Higgins, Jonathan; Huang, Kyle; Keller, Thomas Michael; Shen, Dawei. The adjacency spectra of some families of minimally connected prime graphs. Involve 17 (2024), no. 1, 107–120.
• Zbl 1533.05137: Wang, Zhilan; Qi, Yuzhen; Yan, Jin. Vertex-disjoint cycles of the same length in tournaments. Journal of Graph Theory 102 (2023), no. 4, 666–683.
• Zbl 1522.05072: Morin, Pat. A fast algorithm for the product structure of planar graphs. Algorithmica 83 (2021), no. 5, 1544–1558.
• Zbl 1512.05281: Seeger, Alberto; Sossa, David. 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: Safe, Martín D. Essential obstacles to Helly circular-arc graphs. Discrete Applied Mathematics 320 (2022), 245–258.
• Zbl 1494.05058: Gerbner, Dániel; Palmer, Cory. Some exact results for generalized Turán problems. European Journal of Combinatorics 103 (2022), Paper No. 103519, 13 pp.
• Zbl 1487.05100: Shyama, S.; Chithra, M. R. 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.

• Grötzsch, Herbert. 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]
• Neumann Lara, Víctor. 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]
• Arnautov, V. I. 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.
• Vizing, V. G. 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.
• Negami, Seiya. 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.
• Mirzakhani, Maryam. 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.