Goldman, André The cosine-sine decomposition and conditional negative correlation inequalities for determinantal processes. (English) Zbl 07964599 J. Theor. Probab. 38, No. 1, Paper No. 26, 37 p. (2025). MSC: 60K99 60G55 15A23 68U99 15A75 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Gu, Xiaofeng; Li, Jessica; Yang, Eric H.; Zhang, William Y. Cyclic base ordering of certain degenerate graphs. (English) Zbl 07962129 Discrete Appl. Math. 362, 148-156 (2025). MSC: 05C05 05C35 × Cite Format Result Cite Review PDF Full Text: DOI
Győri, Ervin; Li, Binlong; Salia, Nika; Tompkins, Casey A note on universal graphs for spanning trees. (English) Zbl 07962128 Discrete Appl. Math. 362, 146-147 (2025). MSC: 05C30 05C05 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
He, Qi; Wang, Yan; Fan, Jianxi; Cheng, Baolei Vertex-independent spanning trees in complete Josephus cubes. (English) Zbl 07957616 Theor. Comput. Sci. 1025, Article ID 114969, 16 p. (2025). MSC: 68R10 68W10 68W40 × Cite Format Result Cite Review PDF Full Text: DOI
Fan, Ao; Liu, Ruifang; Ao, Guoyan Spectral radius, odd \([1, b]\)-factor and spanning \(k\)-tree of 1-binding graphs. (English) Zbl 07955788 Linear Algebra Appl. 705, 1-16 (2025). MSC: 05C50 05C35 05C05 × Cite Format Result Cite Review PDF Full Text: DOI
Furuya, Michitaka; Saito, Akira; Tsuchiya, Shoichi Refinements of degree conditions for the existence of a spanning tree without small degree stems. (English) Zbl 07952113 Discrete Math. 348, No. 2, Article ID 114307, 11 p. (2025). MSC: 05C07 05C10 05C05 05C35 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Yang, Chenlin; Tian, Tao Counting spanning trees of multiple complete split-like graph containing a given spanning forest. (English) Zbl 07952106 Discrete Math. 348, No. 2, Article ID 114300, 10 p. (2025). MSC: 05C30 05C22 05C05 × Cite Format Result Cite Review PDF Full Text: DOI
Wu, Jie Characterizing spanning trees via the size or the spectral radius of graphs. (English) Zbl 07962138 Aequationes Math. 98, No. 6, 1441-1455 (2024). MSC: 05C50 05C05 05C12 90B99 × Cite Format Result Cite Review PDF Full Text: DOI
Bozkurt Altındağ, Ş. B.; Milovanović, I.; Milovanović, E. Laplacian coefficients, Kirchhoff index and the number of spanning trees of graphs. (English) Zbl 07956122 Asian-Eur. J. Math. 17, No. 4, Article ID 2450033, 17 p. (2024). MSC: 05C05 05C50 15A18 05C09 05C30 × Cite Format Result Cite Review PDF Full Text: DOI
Chen, Guantao; Tura, Fernando C. A linear algorithm for obtaining the Laplacian eigenvalues of a cograph. (English) Zbl 07952356 Spec. Matrices 12, Article ID 20240024, 14 p. (2024). MSC: 05C85 15A18 05C50 05C05 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Archer, Eleanor; Shalev, Matan The GHP scaling limit of uniform spanning trees of dense graphs. (English) Zbl 07947035 Random Struct. Algorithms 65, No. 1, 149-190 (2024). MSC: 05C81 05C80 05C05 05C42 60C05 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Abu-Affash, A. Karim; Carmi, Paz; Maman, Meytal Piercing diametral disks induced by edges of maximum spanning trees. (English) Zbl 07942900 J. Graph Algorithms Appl. 28, No. 3, 3-10 (2024). MSC: 05C05 05C35 × Cite Format Result Cite Review PDF Full Text: DOI
Chen, Hanlin Tutte polynomials for some chemical polycyclic graphs. (English) Zbl 07941589 J. Math. Chem. 62, No. 10, 2625-2650 (2024). MSC: 05C31 05C92 92E10 05C05 × Cite Format Result Cite Review PDF Full Text: DOI
van Engelenburg, Diederik; Hutchcroft, Tom The number of ends in the uniform spanning tree for recurrent unimodular random graphs. (English) Zbl 07940221 Ann. Probab. 52, No. 6, 2079-2103 (2024). MSC: 05C80 05C05 60D05 60J45 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
He, Mengya; Li, Huixian; Song, Ning; Ji, Shengjin The zero forcing number of claw-free cubic graphs. (English) Zbl 07939397 Discrete Appl. Math. 359, 321-330 (2024). MSC: 05C05 05C15 68R10 × Cite Format Result Cite Review PDF Full Text: DOI
Ge, Jun; Liao, Yucui; Zhang, Bohan Resistance distances and the Moon-type formula of a vertex-weighted complete split graph. (English) Zbl 07939372 Discrete Appl. Math. 359, 10-15 (2024). MSC: 05C30 05C05 05C12 05C22 × Cite Format Result Cite Review PDF Full Text: DOI
Correddu, Mario; Trevisan, Dario On minimum spanning trees for random Euclidean bipartite graphs. (English) Zbl 07938727 Comb. Probab. Comput. 33, No. 3, 319-350 (2024). MSC: 05C05 60G55 60F25 60D05 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Han, Jie; Hu, Jie; Ping, Lidan; Wang, Guanghui; Wang, Yi; Yang, Donglei Spanning trees in graphs without large bipartite holes. (English) Zbl 07938724 Comb. Probab. Comput. 33, No. 3, 270-285 (2024). MSC: 05C05 05C35 05C05 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Luo, Zhao Tang; Sang, Huiyan; Mallick, Bani A nonstationary soft partitioned Gaussian process model via random spanning trees. (English) Zbl 07937801 J. Am. Stat. Assoc. 119, No. 547, 2105-2116 (2024). MSC: 62-XX × Cite Format Result Cite Review PDF Full Text: DOI
McGown, Kevin; Vallières, Daniel On abelian \(\ell\)-towers of multigraphs. III. (English. French summary) Zbl 07936984 Ann. Math. Qué. 48, No. 1, 1-19 (2024). MSC: 11R18 11Z05 13F20 05C25 05C05 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Dewar, Sean; Hewetson, John; Nixon, Anthony Uniquely realisable graphs in analytic normed planes. (English) Zbl 07936813 Int. Math. Res. Not. 2024, No. 17, 12269-12302 (2024). MSC: 05C10 05C85 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Ryan, Christopher T.; Smith, Robert L.; Epelman, Marina A. Minimum spanning trees in infinite graphs: theory and algorithms. (English) Zbl 07930267 SIAM J. Optim. 34, No. 3, 3112-3135 (2024). MSC: 90C27 90C35 90C48 × Cite Format Result Cite Review PDF Full Text: DOI
Ha, Pham Hoang; Trang, Nguyen Hoang Spanning trees with at most \(5\) leaves and branch vertices in total of \(K_{1,5}\)-free graphs. (English) Zbl 07927132 Taiwanese J. Math. 28, No. 5, 847-855 (2024). Reviewer: Prashant Pralhad Malavadkar (Pune) MSC: 05C05 05C07 05C69 × Cite Format Result Cite Review PDF Full Text: DOI arXiv Link
Gong, Helin; Gong, Yu; Ge, Jun The number of spanning trees in \(K_n\)-complement of a bipartite graph. (English) Zbl 07925634 J. Algebr. Comb. 60, No. 2, 541-554 (2024). MSC: 05C30 05C05 × Cite Format Result Cite Review PDF Full Text: DOI
Biniaz, Ahmad; Khamsepour, Parham The minimum consistent spanning subset problem on trees. (English) Zbl 07923826 J. Graph Algorithms Appl. 28, No. 1, 81-93 (2024). MSC: 05C05 90C39 × Cite Format Result Cite Review PDF Full Text: DOI
Avena, Luca; Driessen, Jannetje; Koperberg, Twan Loop-erased partitioning via parametric spanning trees: monotonicities & 1D-scaling. (English) Zbl 07923202 Stochastic Processes Appl. 176, Article ID 104436, 28 p. (2024). MSC: 05C20 05C22 05C50 05A18 05C05 05C81 05C85 60J10 60J28 × Cite Format Result Cite Review PDF Full Text: DOI
Kapidani, Bernard; Merkel, Melina; Schöps, Sebastian; Vázquez, Rafael Arbitrary order spline representation of cohomology generators for isogeometric analysis of eddy current problems. (English) Zbl 07922740 Adv. Comput. Math. 50, No. 5, Paper No. 92, 26 p. (2024). MSC: 65N30 65D07 65N50 58A12 14F40 78A25 78M10 35Q61 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Furuya, Michitaka; Tsuchiya, Shoichi Forbidden subgraphs restricting vertices of degree two in a spanning tree. (English) Zbl 07922005 Electron. J. Comb. 31, No. 3, Research Paper P3.31, 22 p. (2024). MSC: 05C05 05C75 × Cite Format Result Cite Review PDF Full Text: DOI
Zhou, Sizhong; Zhang, Yuli; Liu, Hongxia Spanning \(k\)-trees and distance signless Laplacian spectral radius of graphs. (English) Zbl 1547.05188 Discrete Appl. Math. 358, 358-365 (2024). MSC: 05C50 05C05 15A18 × Cite Format Result Cite Review PDF Full Text: DOI
Li, Danyi; Feng, Xing; Yan, Weigen Enumeration of spanning trees with a perfect matching of hexagonal lattices on the cylinder and Möbius strip. (English) Zbl 1547.05059 Discrete Appl. Math. 358, 320-325 (2024). MSC: 05C09 05C30 05C05 05C70 05C92 92E10 × Cite Format Result Cite Review PDF Full Text: DOI
Ha, Pham Hoang; Hahn, Dang Dinh; Nam, Le Dinh; Nhan, Nguyen Huu Spanning trees whose stems are caterpillars. (English) Zbl 07915726 Stud. Sci. Math. Hung. 61, No. 2, 134-146 (2024). MSC: 05C05 05C70 05C07 05C69 × Cite Format Result Cite Review PDF Full Text: DOI
Ha, Pham Hoang; Nam, Le Dinh; Pham, Ngoc Diep Spanning trees of \(K_{1,4}\)-free graphs whose reducible stems have few leaves. (English) Zbl 07915704 Period. Math. Hung. 89, No. 1, 61-71 (2024). MSC: 05C05 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Dutta, Apratim; Muthu, Rahul; Tawari, Anuj; Sunitha, V. Exactly \(k\) MSTs: How many vertices suffice? (English) Zbl 07914059 Wu, Weili (ed.) et al., Combinatorial optimization and applications. 16th international conference, COCOA 2023, Hawaii, HI, USA, December 15–17, 2023. Proceedings. Part I. Cham: Springer. Lect. Notes Comput. Sci. 14461, 94-106 (2024). MSC: 90C27 × Cite Format Result Cite Review PDF Full Text: DOI
Espuny Díaz, Alberto; Lichev, Lyuben; Mitsche, Dieter; Wesolek, Alexandra Sharp threshold for embedding balanced spanning trees in random geometric graphs. (English) Zbl 1546.05132 J. Graph Theory 107, No. 1, 107-125 (2024); correction ibid. 107, No. 4, 847 (2024). MSC: 05C80 05C05 05C85 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Jackson, Bill; Yoshimoto, Kiyoshi Spanning even trees of graphs. (English) Zbl 1546.05051 J. Graph Theory 107, No. 1, 95-106 (2024). MSC: 05C05 × Cite Format Result Cite Review PDF Full Text: DOI
Došlić, Tomislav Multiplicative Zagreb indices and extremal complexity of line graphs. (English) Zbl 1545.92165 Iran. J. Math. Chem. 15, No. 1, 7-16 (2024). MSC: 92E10 05C92 05C09 05C05 × Cite Format Result Cite Review PDF Full Text: DOI
Werf, Andrew Vander Simplex links in determinantal hypertrees. (English) Zbl 1543.05200 J. Appl. Comput. Topol. 8, No. 2, 401-426 (2024). MSC: 05E45 05C05 60C05 60B99 55U05 55U10 55U15 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Hamilton, John; Shahmohamad, Hossein Finding optimal spanning trees for damaged networks. (English) Zbl 1545.05203 J. Comb. Math. Comb. Comput. 121, 67-70 (2024). MSC: 05C82 05C05 × Cite Format Result Cite Review PDF Full Text: DOI
Cameron, Ben; Grubb, Aaron; Sawada, Joe Pivot Gray codes for the spanning trees of a graph ft. the fan. (English) Zbl 1544.05105 Graphs Comb. 40, No. 4, Paper No. 78, 26 p. (2024). MSC: 05C85 05C05 05C75 68R10 94B25 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Nakano, Shin-ichi \((t, s)\)-completely independent spanning trees. (English) Zbl 07883881 Uehara, Ryuhei (ed.) et al., WALCOM: algorithms and computation. 18th international conference and workshops on algorithms and computation, WALCOM 2024, Kanazawa, Japan, March 18–20, 2024. Proceedings. Singapore: Springer. Lect. Notes Comput. Sci. 14549, 365-376 (2024). MSC: 68Wxx × Cite Format Result Cite Review PDF Full Text: DOI
Chang, Ching-Lueh; Chang, Chun-Wei Approximating all-points furthest pairs and maximum spanning trees in metric spaces. (English) Zbl 07878891 Int. J. Found. Comput. Sci. 35, No. 5, 595-603 (2024). MSC: 68Wxx 05Cxx 68Qxx × Cite Format Result Cite Review PDF Full Text: DOI
Lin, Hsin-Jung; Tang, Shyue-Ming; Pai, Kung-Jui; Chang, Jou-Ming A recursive algorithm for constructing dual-CISTs in hierarchical folded cubic networks. (English) Zbl 1543.05169 Int. J. Found. Comput. Sci. 35, No. 5, 535-550 (2024). MSC: 05C82 05C05 68R10 × Cite Format Result Cite Review PDF Full Text: DOI
Hong, Xia; Gao, Feng; Wu, Zengbao Mimimal graphs for completely independent spanning trees and completely independent spanning trees in complete \(T\)-partite graph. (English) Zbl 1541.05028 Contrib. Discrete Math. 19, No. 2, 23-35 (2024). MSC: 05C05 05C35 × Cite Format Result Cite Review PDF Full Text: Link
Joos, Felix; Schrodt, Jonathan Counting oriented trees in digraphs with large minimum semidegree. (English) Zbl 1543.05084 J. Comb. Theory, Ser. B 168, 236-270 (2024). MSC: 05C30 05C05 05C20 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Pehova, Yanitsa; Petrova, Kalina Embedding loose spanning trees in 3-uniform hypergraphs. (English) Zbl 1542.05121 J. Comb. Theory, Ser. B 168, 47-67 (2024). MSC: 05C60 05C05 05C65 05C35 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Cori, Robert; Hetyei, Gábor Spanning hypertrees, vertex tours and meanders. (English) Zbl 1542.05041 Eur. J. Comb. 119, Article ID 103805, 29 p. (2024). MSC: 05C10 05A05 05A18 05A15 05C31 05C05 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Gu, Xiaofeng; Zhang, William Cyclic base ordering of generalized Petersen graphs. (English) Zbl 1539.05017 Discrete Math. Algorithms Appl. 16, No. 2, Article ID 2350019, 19 p. (2024). MSC: 05C05 05C42 05C70 × Cite Format Result Cite Review PDF Full Text: DOI
Acquaviva, Sarah; Bal, Deepak Full degree spanning trees in random regular graphs. (English) Zbl 1540.05153 Discrete Appl. Math. 353, 85-93 (2024). MSC: 05C80 05C05 05C07 05C85 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Hörsch, Florian; Kaiser, Tomáš; Kriesell, Matthias Rainbow bases in matroids. (English) Zbl 1539.05013 SIAM J. Discrete Math. 38, No. 2, 1472-1491 (2024). MSC: 05B35 05C15 05C05 05C70 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Cai, Junqing; Zhai, Huiming; Liang, Zuosong Spanning trees with few branch vertices in \(K_{1,4}\)-free graphs. (English) Zbl 1539.05016 Discrete Math. 347, No. 7, Article ID 114009, 12 p. (2024). MSC: 05C05 05C07 × Cite Format Result Cite Review PDF Full Text: DOI
Bradshaw, Peter Rainbow spanning trees in random subgraphs of dense regular graphs. (English) Zbl 1536.05408 Discrete Math. 347, No. 6, Article ID 113960, 11 p. (2024). MSC: 05C80 05C05 05C42 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Pitz, Max Applications of order trees in infinite graphs. (English) Zbl 07839448 Order 41, No. 1, 65-81 (2024). MSC: 05C63 05C05 05C15 × Cite Format Result Cite Review PDF Full Text: DOI
Hu, Xiaozhe; Lin, Junyuan Solving graph Laplacians via multilevel sparsifiers. (English) Zbl 07837057 SIAM J. Sci. Comput. 46, No. 2, S378-S400 (2024). MSC: 05C50 05C85 65F10 68R10 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Xiong, Qi; Tian, Gui-Xian; Cui, Shu-Yu More on minors of Hermitian (quasi-)Laplacian matrix of the second kind for mixed graphs. (English) Zbl 07830980 Comput. Appl. Math. 43, No. 1, Paper No. 62, 17 p. (2024). MSC: 05C50 15A18 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Francis, Andrew; Marchei, Daniele; Steel, Mike Phylogenetic network classes through the lens of expanding covers. (English) Zbl 1536.92076 J. Math. Biol. 88, No. 5, Paper No. 58, 27 p. (2024). MSC: 92D15 05C05 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
De Caria Di Fonzo, Pablo Cycle intersection in spanning trees: a shorter proof of a conjecture and applications. (English) Zbl 1536.05133 Discrete Appl. Math. 350, 10-14 (2024). MSC: 05C05 05C38 68R10 × Cite Format Result Cite Review PDF Full Text: DOI
Zhou, Sizhong; Sun, Zhiren; Liu, Hongxia \(\mathcal{D}\)-index and \(\mathcal{Q}\)-index for spanning trees with leaf degree at most \(k\) in graphs. (English) Zbl 1535.05185 Discrete Math. 347, No. 5, Article ID 113927, 15 p. (2024). MSC: 05C50 05C05 05C40 05C35 15A18 × Cite Format Result Cite Review PDF Full Text: DOI
Gioan, Emeric; Las Vergnas, Michel Computing the fully optimal spanning tree of an ordered bipolar directed graph. (English) Zbl 1535.05123 Discrete Math. 347, No. 5, Article ID 113895, 15 p. (2024). MSC: 05C20 05C05 68Q17 05C31 90C05 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Archer, Eleanor; Nachmias, Asaf; Shalev, Matan The GHP scaling limit of uniform spanning trees in high dimensions. (English) Zbl 1535.05233 Commun. Math. Phys. 405, No. 3, Paper No. 73, 41 p. (2024). MSC: 05C80 05C05 05D40 60G50 60K35 60D05 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Munemasa, Akihiro; Tanaka, Yuuho Convex subgraphs and spanning trees of the square cycles. (English) Zbl 1535.05145 Australas. J. Comb. 88, Part 2, 204-211 (2024). MSC: 05C30 05C05 05C38 05C40 × Cite Format Result Cite Review PDF Full Text: arXiv Link
Bhamidi, Shankar; Sen, Sanchayan Geometry of the minimal spanning tree in the heavy-tailed regime: new universality classes. (English) Zbl 07819896 Probab. Theory Relat. Fields 188, No. 3-4, 729-804 (2024). MSC: 60C05 05C80 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Bal, Deepak; Frieze, Alan; Prałat, Paweł Rainbow spanning trees in randomly colored \(G_{k-out}\). (English) Zbl 1533.05083 SIAM J. Discrete Math. 38, No. 1, 867-882 (2024). MSC: 05C15 05C05 05C80 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Dong, Yanni; Broersma, Hajo; Bai, Yuhang; Zhang, Shenggui The complexity of spanning tree problems involving graphical indices. (English) Zbl 1533.05054 Discrete Appl. Math. 347, 143-154 (2024). MSC: 05C05 05C09 68Q17 92E10 05C92 × Cite Format Result Cite Review PDF Full Text: DOI
Barát, János; Gyárfás, András; Tóth, Géza Monochromatic spanning trees and matchings in ordered complete graphs. (English) Zbl 1533.05084 J. Graph Theory 105, No. 4, 523-541 (2024). MSC: 05C15 05C05 05D10 05C55 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Chen, Tengjie; Yuan, Zhenhua; Peng, Junhao The normalized Laplacian spectrum of \(n\)-polygon graphs and applications. (English) Zbl 1536.05287 Linear Multilinear Algebra 72, No. 2, 234-260 (2024). Reviewer: Nikolaos Fountoulakis (Birmingham) MSC: 05C50 05C81 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Mattman, Thomas W. A novel count of the spanning trees of a cube. (English) Zbl 1532.05091 Graphs Comb. 40, No. 1, Paper No. 19, 3 p. (2024). MSC: 05C30 05C05 05C25 11M41 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Liu, Jiuqiang; Zhang, Shenggui; Yu, Guihai Generating functions and counting formulas for spanning trees and forests in hypergraphs. (English) Zbl 1532.05090 Adv. Appl. Math. 155, Article ID 102667, 23 p. (2024). MSC: 05C30 05C65 05C05 05A15 05C50 × Cite Format Result Cite Review PDF Full Text: DOI
Bessy, Stéphane; Hörsch, Florian; Maia, Ana Karolinna; Rautenbach, Dieter; Sau, Ignasi FPT algorithms for packing \(k\)-safe spanning rooted sub(di)graphs. (English) Zbl 1532.05133 Discrete Appl. Math. 346, 80-94 (2024). MSC: 05C70 05C20 68Q25 68W05 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Pham Hoang Ha Progress on sufficient conditions for a graph to have a spanning \(k\)-ended tree. (English) Zbl 1530.05029 Vietnam J. Math. 52, No. 1, 69-74 (2024). MSC: 05C05 05C70 05C07 05C69 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Doerr, Benjamin; Rajabi, Amirhossein; Witt, Carsten Simulated annealing is a polynomial-time approximation scheme for the minimum spanning tree problem. (English) Zbl 07785275 Algorithmica 86, No. 1, 64-89 (2024). MSC: 68Wxx 05Cxx × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Su, Tai-Yu Minimum spanning tree cycle intersection problem on outerplanar graphs. (English) Zbl 1529.05095 Discrete Appl. Math. 343, 328-339 (2024). MSC: 05C38 05C05 05C10 05C40 × Cite Format Result Cite Review PDF Full Text: DOI
Zhang, Jingyuan; Lu, Fuliang; Jin, Xian’an Counting spanning trees of \((1, N\))-periodic graphs. (English) Zbl 1529.05089 Discrete Appl. Math. 344, 88-101 (2024). MSC: 05C30 05C05 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Yang, Yujun; Xu, Can On two conjectures concerning spanning tree edge dependences of graphs. (English) Zbl 1529.05040 Discrete Appl. Math. 344, 32-42 (2024). MSC: 05C05 05C12 05C10 05C75 94C15 × Cite Format Result Cite Review PDF Full Text: DOI
Gargano, Luisa; Rescigno, Adele A. An FPT algorithm for spanning trees with few branch vertices parameterized by modular-width. (English) Zbl 07953299 Leroux, Jérôme (ed.) et al., 48th international symposium on mathematical foundations of computer science, MFCS 2023, Bordeaux, France, August 28 – September 1, 2023. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 272, Article 50, 15 p. (2023). MSC: 68Qxx × Cite Format Result Cite Review PDF Full Text: DOI
Frati, Fabrizio; Hoffmann, Michael; Tóth, Csaba D. Universal geometric graphs. (English) Zbl 07938693 Comb. Probab. Comput. 32, No. 5, 742-761 (2023). MSC: 05C10 05C05 05C35 05C60 05C62 68R10 × Cite Format Result Cite Review PDF Full Text: DOI
Lu, Zhiqin; Ma, Xiaoling; Zhang, Minshao Spectra of graph operations based on splitting graph. (English) Zbl 07919787 J. Appl. Anal. Comput. 13, No. 1, 133-155 (2023). MSC: 05C50 × Cite Format Result Cite Review PDF Full Text: DOI
Aboutahoun, A. W.; El-Safty, F. Tutte polynomial of self-similar network models with applications. (English) Zbl 07860385 Ars Comb. 157, 53-63 (2023). MSC: 82B20 05C30 05C31 × Cite Format Result Cite Review PDF Full Text: DOI
DuBose, Sage; Vallières, Daniel On \(\mathbb{Z}_{\ell}^d\)-towers of graphs. (English) Zbl 1533.05114 Algebr. Comb. 6, No. 5, 1331-1346 (2023). MSC: 05C25 11R18 11R23 11Z05 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Yang, Gang; Liao, Yunhua Tutte polynomial of tensor product graph and its applications. (Chinese. English summary) Zbl 07801749 Acta Math. Appl. Sin. 46, No. 4, 507-521 (2023). MSC: 05C31 05C76 05C30 05C05 05C90 × Cite Format Result Cite Review PDF Full Text: Link
Addario-Berry, Louigi; Barrett, Jordan Multisource invasion percolation on the complete graph. (English) Zbl 07795618 Ann. Probab. 51, No. 6, 2131-2157 (2023). MSC: 60K35 60C05 05C80 82B43 82C43 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Mednykh, Alexander D.; Mednykh, Il’ya A. Cyclic coverings of graphs. Counting rooted spanning forests and trees, Kirchhoff index, and Jacobians. (English. Russian original) Zbl 1531.05207 Russ. Math. Surv. 78, No. 3, 501-548 (2023); translation from Usp. Mat. Nauk 78, No. 3, 115-164 (2023). MSC: 05C70 05C05 05C25 05C50 05C30 11B39 57M15 × Cite Format Result Cite Review PDF Full Text: DOI MNR
Ji, Shengjin; He, Mengya; Li, Guang; Pan, Yingui; Zhang, Wenqian Bounding the total forcing number of graphs. (English) Zbl 1536.05189 J. Comb. Optim. 46, No. 4, Paper No. 25, 8 p. (2023). MSC: 05C15 05C69 05C05 05C30 × Cite Format Result Cite Review PDF Full Text: DOI
McCartan, Cory; Imai, Kosuke Sequential Monte Carlo for sampling balanced and compact redistricting plans. (English) Zbl 07789430 Ann. Appl. Stat. 17, No. 4, 3300-3323 (2023). MSC: 62Pxx × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Fredes, Luis; Marckert, Jean-François Models of random subtrees of a graph. (English) Zbl 1527.60010 Probab. Surv. 20, 722-801 (2023). MSC: 60C05 05C05 60J10 60F17 60-02 × Cite Format Result Cite Review PDF Full Text: DOI arXiv Link
Kovchegov, Yevgeniy; Otto, Peter T. Multidimensional Lambert-Euler inversion and vector-multiplicative coalescent processes. (English) Zbl 1538.60160 J. Stat. Phys. 190, No. 12, Paper No. 188, 26 p. (2023). MSC: 60K35 60J90 60C05 05C50 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Koch, Sebastian Introduction to graph enumerations. (English) Zbl 1542.68221 Formaliz. Math. 31, No. 1, 31-52 (2023). MSC: 68V20 05C05 05C30 × Cite Format Result Cite Review PDF Full Text: DOI
Lin, Zhen; Zhang, Rong; Wang, Juan Some new lower bounds on the algebraic connectivity of graphs. (English) Zbl 1538.05178 Contrib. Math. 7, 53-59 (2023). MSC: 05C50 05C07 05C09 05C05 15A18 × Cite Format Result Cite Review PDF Full Text: DOI
Liao, I-Cheng; Lu, Hsueh-I A simple \(2\)-approximation for maximum-leaf spanning tree. (English) Zbl 07766093 Int. J. Found. Comput. Sci. 34, No. 7, 795-805 (2023). MSC: 68W25 68Q25 68R10 05C05 05C85 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Kardam, Yogita Singh; Srivastava, Kamal; Martí, Rafael General variable neighborhood search for the minimum stretch spanning tree problem. (English) Zbl 1534.90174 Optim. Lett. 17, No. 9, 2005-2031 (2023). MSC: 90C35 × Cite Format Result Cite Review PDF Full Text: DOI
Shan, Songling; Tsuchiya, Shoichi Characterization of graphs of diameter 2 containing a homeomorphically irreducible spanning tree. (English) Zbl 1526.05042 J. Graph Theory 104, No. 4, 886-903 (2023). MSC: 05C12 05C05 × Cite Format Result Cite Review PDF Full Text: DOI
Gimadi, E. Kh.; Shtepa, A. A. On asymptotically optimal approach for finding of the minimum total weight of edge-disjoint spanning trees with a given diameter. (English. Russian original) Zbl 1525.05067 Autom. Remote Control 84, No. 7, 772-787 (2023); translation from Avtom. Telemekh. 2023, No. 7, 146-166 (2023). MSC: 05C22 05C05 68W25 05C85 × Cite Format Result Cite Review PDF Full Text: DOI
McGown, Kevin; Vallières, Daniel On abelian \(\ell \)-towers of multigraphs. II. (English. French summary) Zbl 1525.05081 Ann. Math. Qué. 47, No. 2, 461-473 (2023). MSC: 05C25 05C10 11R18 11R37 11A07 33C45 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Yuster, Raphael The number of bounded-degree spanning trees. (English) Zbl 1522.05042 Random Struct. Algorithms 62, No. 3, 737-757 (2023). MSC: 05C05 05C30 05C07 05C40 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Fredes, Luis; Marckert, Jean-François A combinatorial proof of Aldous-Broder theorem for general Markov chains. (English) Zbl 1522.05426 Random Struct. Algorithms 62, No. 2, 430-449 (2023). MSC: 05C80 05C05 05C40 05C81 60J10 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Li, Danyi; Chen, Wuxian; Yan, Weigen Enumeration of spanning trees of complete multipartite graphs containing a fixed spanning forest. (English) Zbl 1522.05213 J. Graph Theory 104, No. 1, 160-170 (2023). MSC: 05C30 05C05 × Cite Format Result Cite Review PDF Full Text: DOI
Reed, Bruce; Stein, Maya Spanning trees in graphs of high minimum degree with a universal vertex. II: A tight result. (English) Zbl 1522.05050 J. Graph Theory 102, No. 4, 797-821 (2023). MSC: 05C07 05C35 05C05 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Reed, Bruce; Stein, Maya Spanning trees in graphs of high minimum degree with a universal vertex. I: An asymptotic result. (English) Zbl 1522.05049 J. Graph Theory 102, No. 4, 737-783 (2023). MSC: 05C07 05C35 05C05 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Rosenthal, Ron; Tenenbaum, Lior Simplicial spanning trees in random Steiner complexes. (English) Zbl 07745891 Combinatorica 43, No. 3, 613-650 (2023). MSC: 05E45 05C80 05C05 60C05 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Abdesselam, Abdelmalek A local injective proof of log-concavity for increasing spanning forests. (English) Zbl 1522.05221 Discrete Math. 346, No. 12, Article ID 113651, 7 p. (2023). MSC: 05C31 05C05 11B73 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Cherkashin, Danila; Petrov, Fedor; Prozorov, Pavel On stability of spanning tree degree enumerators. (English) Zbl 1522.05222 Discrete Math. 346, No. 12, Article ID 113629, 7 p. (2023). MSC: 05C31 05C05 05C12 05C40 × Cite Format Result Cite Review PDF Full Text: DOI arXiv