Andrade, Enide; Dahl, Geir Combinatorial Fiedler theory and graph partition. (English) Zbl 07810699 Linear Algebra Appl. 687, 229-251 (2024). MSC: 05C70 05C40 05C50 15A18 05C05 05C82 PDFBibTeX XMLCite \textit{E. Andrade} and \textit{G. Dahl}, Linear Algebra Appl. 687, 229--251 (2024; Zbl 07810699) Full Text: DOI arXiv
Marcucci, Tobia; Umenberger, Jack; Parrilo, Pablo; Tedrake, Russ Shortest paths in graphs of convex sets. (English) Zbl 07801128 SIAM J. Optim. 34, No. 1, 507-532 (2024). MSC: 05C12 05C38 90C11 90C25 90C35 90C57 93C55 93C83 PDFBibTeX XMLCite \textit{T. Marcucci} et al., SIAM J. Optim. 34, No. 1, 507--532 (2024; Zbl 07801128) Full Text: DOI arXiv
Eldén, Lars Multiway spectral graph partitioning: cut functions, Cheeger inequalities, and a simple algorithm. (English) Zbl 07791521 SIAM J. Matrix Anal. Appl. 45, No. 1, 112-133 (2024). MSC: 68R10 05C50 PDFBibTeX XMLCite \textit{L. Eldén}, SIAM J. Matrix Anal. Appl. 45, No. 1, 112--133 (2024; Zbl 07791521) Full Text: DOI arXiv
Zhang, Licheng; Huang, Yuanqiu; Wang, Guiping On the edge-connectivity and restricted edge-connectivity of optimal 1-planar graphs. (English) Zbl 1527.05107 Bull. Malays. Math. Sci. Soc. (2) 47, No. 1, Paper No. 2, 15 p. (2024). MSC: 05C40 05C10 05C62 PDFBibTeX XMLCite \textit{L. Zhang} et al., Bull. Malays. Math. Sci. Soc. (2) 47, No. 1, Paper No. 2, 15 p. (2024; Zbl 1527.05107) Full Text: DOI
Kung, Tzu-Liang Reliability evaluation for bijection-connected networks based on the super \(P_k\)-connectivity. (English) Zbl 07764819 Appl. Math. Comput. 464, Article ID 128397, 13 p. (2024). MSC: 05Cxx 68Rxx 68Mxx PDFBibTeX XMLCite \textit{T.-L. Kung}, Appl. Math. Comput. 464, Article ID 128397, 13 p. (2024; Zbl 07764819) Full Text: DOI
Wei, Wei; Liu, Yuting; Zhang, Qinghui An optimal pruned traversal tree-based fast minimum cut solver in dense graph. (English) Zbl 07759689 Inf. Sci. 652, Article ID 119768, 13 p. (2024). MSC: 68-XX 92-XX PDFBibTeX XMLCite \textit{W. Wei} et al., Inf. Sci. 652, Article ID 119768, 13 p. (2024; Zbl 07759689) Full Text: DOI
Davis, Donald M.; Guo, Manyi Isomorphism classes of cut loci for a cube. (English) Zbl 1526.05120 Discrete Math. 347, No. 1, Article ID 113709, 10 p. (2024). MSC: 05C78 52B05 PDFBibTeX XMLCite \textit{D. M. Davis} and \textit{M. Guo}, Discrete Math. 347, No. 1, Article ID 113709, 10 p. (2024; Zbl 1526.05120) Full Text: DOI arXiv
Obscura Acosta, Nidia; Tomescu, Alexandru I. Simplicity in Eulerian circuits: uniqueness and safety. (English) Zbl 07749682 Inf. Process. Lett. 183, Article ID 106421, 5 p. (2024). MSC: 05C85 05C45 PDFBibTeX XMLCite \textit{N. Obscura Acosta} and \textit{A. I. Tomescu}, Inf. Process. Lett. 183, Article ID 106421, 5 p. (2024; Zbl 07749682) Full Text: DOI arXiv
Soliemany, Farnaz; Ghasemi, Mohsen; Varmazyar, Rezvan Under which conditions is \(\lambda'' (G) = \kappa''(L(G))\)? (English) Zbl 07815936 AKCE Int. J. Graphs Comb. 20, No. 3, 244-246 (2023). MSC: 05C40 05C90 PDFBibTeX XMLCite \textit{F. Soliemany} et al., AKCE Int. J. Graphs Comb. 20, No. 3, 244--246 (2023; Zbl 07815936) Full Text: DOI OA License
Ferone, Daniele; Festa, Paola; Fugaro, Serena; Pastore, Tommaso The resource constrained clustered shortest path tree problem: mathematical formulation and branch&price solution algorithm. (English) Zbl 07780110 Networks 81, No. 2, 204-219 (2023). MSC: 90C35 90C57 PDFBibTeX XMLCite \textit{D. Ferone} et al., Networks 81, No. 2, 204--219 (2023; Zbl 07780110) Full Text: DOI OA License
Boggio Tomasaz, Alberto; Cordone, Roberto; Hosteins, Pierre A combinatorial branch and bound for the safe set problem. (English) Zbl 07780095 Networks 81, No. 4, 445-464 (2023). MSC: 90C57 05C70 90C35 PDFBibTeX XMLCite \textit{A. Boggio Tomasaz} et al., Networks 81, No. 4, 445--464 (2023; Zbl 07780095) Full Text: DOI
Binucci, Carla; Da Lozzo, Giordano; Di Giacomo, Emilio; Didimo, Walter; Mchedlidze, Tamara; Patrignani, Maurizio Upward book embeddability of \(st\)-graphs: complexity and algorithms. (English) Zbl 07777564 Algorithmica 85, No. 12, 3521-3571 (2023). MSC: 68Wxx 05Cxx PDFBibTeX XMLCite \textit{C. Binucci} et al., Algorithmica 85, No. 12, 3521--3571 (2023; Zbl 07777564) Full Text: DOI OA License
Poremba, Joseph; Shepherd, F. Bruce Cut-sufficient directed 2-commodity multiflow topologies. (English) Zbl 1528.90227 Del Pia, Alberto (ed.) et al., Integer programming and combinatorial optimization. 24th international conference, IPCO 2023, Madison, WI, USA, June 21–23, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13904, 408-422 (2023). MSC: 90C27 05C21 68R10 90B10 90C35 PDFBibTeX XMLCite \textit{J. Poremba} and \textit{F. B. Shepherd}, Lect. Notes Comput. Sci. 13904, 408--422 (2023; Zbl 1528.90227) Full Text: DOI
Sun, Jian; Zhang, Zan-Bo; Chen, Yannan; Han, Deren; Du, Donglei; Zhang, Xiaoyan A maximum hypergraph 3-cut problem with limited unbalance: approximation and analysis. (English) Zbl 1528.90229 J. Glob. Optim. 87, No. 2-4, 917-937 (2023). MSC: 90C27 68R10 68W20 68W25 90C22 PDFBibTeX XMLCite \textit{J. Sun} et al., J. Glob. Optim. 87, No. 2--4, 917--937 (2023; Zbl 1528.90229) Full Text: DOI
Wu, Shufei; Li, Amin Max-cut by excluding bipartite subgraphs. (English) Zbl 1525.05090 Bull. Aust. Math. Soc. 108, No. 2, 177-186 (2023). MSC: 05C30 05C70 05C35 05C75 PDFBibTeX XMLCite \textit{S. Wu} and \textit{A. Li}, Bull. Aust. Math. Soc. 108, No. 2, 177--186 (2023; Zbl 1525.05090) Full Text: DOI
Linz, Simone; Wicke, Kristina Exploring spaces of semi-directed level-1 networks. (English) Zbl 1525.05176 J. Math. Biol. 87, No. 5, Paper No. 70, 30 p. (2023). MSC: 05C82 05C90 92D15 PDFBibTeX XMLCite \textit{S. Linz} and \textit{K. Wicke}, J. Math. Biol. 87, No. 5, Paper No. 70, 30 p. (2023; Zbl 1525.05176) Full Text: DOI arXiv OA License
Condori, Marcos A. T.; Miranda, Paulo A. V. Differential oriented image foresting transform and its applications to support high-level priors for object segmentation. (English) Zbl 07753641 J. Math. Imaging Vis. 65, No. 5, 802-817 (2023). MSC: 68-XX 94-XX PDFBibTeX XMLCite \textit{M. A. T. Condori} and \textit{P. A. V. Miranda}, J. Math. Imaging Vis. 65, No. 5, 802--817 (2023; Zbl 07753641) Full Text: DOI
Baswana, Surender; Bhanja, Koustav; Pandey, Abhyuday Minimum+1 \((s, t)\)-cuts and dual-edge sensitivity oracle. (English) Zbl 07753189 ACM Trans. Algorithms 19, No. 4, Paper No. 38, 41 p. (2023). MSC: 68-XX PDFBibTeX XMLCite \textit{S. Baswana} et al., ACM Trans. Algorithms 19, No. 4, Paper No. 38, 41 p. (2023; Zbl 07753189) Full Text: DOI
El Alaoui, Ahmed; Montanari, Andrea; Sellke, Mark Local algorithms for maximum cut and minimum bisection on locally treelike regular graphs of large degree. (English) Zbl 07751070 Random Struct. Algorithms 63, No. 3, 689-715 (2023). MSC: 05C70 05C85 05C80 60K35 PDFBibTeX XMLCite \textit{A. El Alaoui} et al., Random Struct. Algorithms 63, No. 3, 689--715 (2023; Zbl 07751070) Full Text: DOI arXiv
de Figueiredo, Celina M. H.; de Melo, Alexsander A.; Oliveira, Fabiano S.; Silva, Ana MaxCut on permutation graphs is NP-complete. (English) Zbl 07747704 J. Graph Theory 104, No. 1, 5-16 (2023). MSC: 68R10 68Wxx 05C99 PDFBibTeX XMLCite \textit{C. M. H. de Figueiredo} et al., J. Graph Theory 104, No. 1, 5--16 (2023; Zbl 07747704) Full Text: DOI arXiv
Lucke, Felicia; Paulusma, Daniël; Ries, Bernard Finding matching cuts in \(H\)-free graphs. (English) Zbl 07746799 Algorithmica 85, No. 10, 3290-3322 (2023). MSC: 68Wxx 05Cxx PDFBibTeX XMLCite \textit{F. Lucke} et al., Algorithmica 85, No. 10, 3290--3322 (2023; Zbl 07746799) Full Text: DOI arXiv OA License
Fox, Jacob; Himwich, Zoe; Mani, Nitya Making an \(H\)-free graph \(k\)-colorable. (English) Zbl 1522.05226 J. Graph Theory 102, No. 2, 234-261 (2023). MSC: 05C35 05C75 05C30 05C15 PDFBibTeX XMLCite \textit{J. Fox} et al., J. Graph Theory 102, No. 2, 234--261 (2023; Zbl 1522.05226) Full Text: DOI arXiv
Nikoletseas, Sotiris; Raptopoulos, Christoforos; Spirakis, Paul MAX CUT in weighted random intersection graphs and discrepancy of sparse random set systems. (English) Zbl 07742471 Algorithmica 85, No. 9, 2817-2842 (2023). MSC: 68Wxx 05Cxx PDFBibTeX XMLCite \textit{S. Nikoletseas} et al., Algorithmica 85, No. 9, 2817--2842 (2023; Zbl 07742471) Full Text: DOI arXiv OA License
Hayat, Sakander; Arshad, Muhammad; Gutman, Ivan Proofs to some open problems on the maximum Sombor index of graphs. (English) Zbl 07735395 Comput. Appl. Math. 42, No. 6, Paper No. 279, 11 p. (2023). MSC: 05C09 05C92 05C07 05C35 05C40 92E10 PDFBibTeX XMLCite \textit{S. Hayat} et al., Comput. Appl. Math. 42, No. 6, Paper No. 279, 11 p. (2023; Zbl 07735395) Full Text: DOI
Bereg, Sergey Computing balanced convex partitions of lines. (English) Zbl 07729253 Algorithmica 85, No. 8, 2515-2528 (2023). MSC: 68Wxx 05Cxx PDFBibTeX XMLCite \textit{S. Bereg}, Algorithmica 85, No. 8, 2515--2528 (2023; Zbl 07729253) Full Text: DOI
Adhikary, Ranendu; Bose, Kaustav; Mukherjee, Satwik; Roy, Bodhayan Complexity of maximum cut on interval graphs. (English) Zbl 07729235 Discrete Comput. Geom. 70, No. 2, 307-322 (2023). MSC: 68Q17 90C27 PDFBibTeX XMLCite \textit{R. Adhikary} et al., Discrete Comput. Geom. 70, No. 2, 307--322 (2023; Zbl 07729235) Full Text: DOI arXiv
Malik, Vineet; Karmakar, Sushanta Some insights on dynamic maintenance of Gomory-Hu tree in cactus graphs and general graphs. (English) Zbl 07728666 Bagchi, Amitabha (ed.) et al., Algorithms and discrete applied mathematics. 9th international conference, CALDAM 2023, Gandhinagar, India, February 9–11, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13947, 231-244 (2023). MSC: 68Wxx PDFBibTeX XMLCite \textit{V. Malik} and \textit{S. Karmakar}, Lect. Notes Comput. Sci. 13947, 231--244 (2023; Zbl 07728666) Full Text: DOI
Safeera, K.; Kumar, V. Anil Vertex cut polynomials of some unary graph operations. (English) Zbl 07727288 Adv. Appl. Discrete Math. 37, 95-103 (2023). MSC: 05C31 05C76 05C40 PDFBibTeX XMLCite \textit{K. Safeera} and \textit{V. A. Kumar}, Adv. Appl. Discrete Math. 37, 95--103 (2023; Zbl 07727288) Full Text: DOI
Wu, Shufei; Hou, Jianfeng Graph partitioning: an updated survey. (English) Zbl 1519.05209 AKCE Int. J. Graphs Comb. 20, No. 1, 9-19 (2023). MSC: 05C70 05C20 05C35 PDFBibTeX XMLCite \textit{S. Wu} and \textit{J. Hou}, AKCE Int. J. Graphs Comb. 20, No. 1, 9--19 (2023; Zbl 1519.05209) Full Text: DOI
O’Rourke, Joseph; Vîlcu, Costin Cut locus realizations on convex polyhedra. (English) Zbl 1519.05107 Comput. Geom. 114, Article ID 102010, 10 p. (2023). MSC: 05C22 05C05 05C62 52B55 52B10 PDFBibTeX XMLCite \textit{J. O'Rourke} and \textit{C. Vîlcu}, Comput. Geom. 114, Article ID 102010, 10 p. (2023; Zbl 1519.05107) Full Text: DOI arXiv
Šajna, Mateja; Wagner, Andrew Using edge cuts to find Euler tours and Euler families in hypergraphs. (English) Zbl 1518.05145 Discrete Math. 346, No. 10, Article ID 113537, 18 p. (2023). MSC: 05C65 05C81 05C85 PDFBibTeX XMLCite \textit{M. Šajna} and \textit{A. Wagner}, Discrete Math. 346, No. 10, Article ID 113537, 18 p. (2023; Zbl 1518.05145) Full Text: DOI arXiv
Klavžar, Sandi; Romih, Gašper Domen The cut method on hypergraphs for the Wiener index. (English) Zbl 1518.05043 J. Math. Chem. 61, No. 7, 1592-1603 (2023). MSC: 05C09 05C12 05C92 92E10 05C65 PDFBibTeX XMLCite \textit{S. Klavžar} and \textit{G. D. Romih}, J. Math. Chem. 61, No. 7, 1592--1603 (2023; Zbl 1518.05043) Full Text: DOI arXiv
Steinerberger, Stefan Max-Cut via Kuramoto-type oscillators. (English) Zbl 07709667 SIAM J. Appl. Dyn. Syst. 22, No. 2, 730-743 (2023). MSC: 68R10 05C69 82B20 90C06 PDFBibTeX XMLCite \textit{S. Steinerberger}, SIAM J. Appl. Dyn. Syst. 22, No. 2, 730--743 (2023; Zbl 07709667) Full Text: DOI arXiv
Lyman, Rylee Alanza On Whitehead’s cut vertex lemma. (English) Zbl 1522.20093 J. Group Theory 26, No. 4, 665-675 (2023). Reviewer: Egle Bettio (Venezia) MSC: 20E05 20F34 05C25 20E08 20E45 PDFBibTeX XMLCite \textit{R. A. Lyman}, J. Group Theory 26, No. 4, 665--675 (2023; Zbl 1522.20093) Full Text: DOI arXiv
Papazaharias, Demetrios V.; Walteros, Jose L. Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations. (English) Zbl 1519.90124 Math. Program. Comput. 15, No. 1, 103-151 (2023). MSC: 90C10 90B10 90C11 90C35 PDFBibTeX XMLCite \textit{D. V. Papazaharias} and \textit{J. L. Walteros}, Math. Program. Comput. 15, No. 1, 103--151 (2023; Zbl 1519.90124) Full Text: DOI
Babecki, Catherine; Thomas, Rekha R. Graphical designs and gale duality. (English) Zbl 1517.05113 Math. Program. 200, No. 2 (B), 703-737 (2023). MSC: 05C51 05C25 05C75 05C50 52B35 90C57 68R10 94A12 PDFBibTeX XMLCite \textit{C. Babecki} and \textit{R. R. Thomas}, Math. Program. 200, No. 2 (B), 703--737 (2023; Zbl 1517.05113) Full Text: DOI arXiv
Ghalavand, Ali; Klavžar, Sandi; Tavakoli, Mostafa Graphs whose mixed metric dimension is equal to their order. (English) Zbl 1524.05082 Comput. Appl. Math. 42, No. 5, Paper No. 210, 7 p. (2023). MSC: 05C12 05C92 92E10 05C76 05C75 PDFBibTeX XMLCite \textit{A. Ghalavand} et al., Comput. Appl. Math. 42, No. 5, Paper No. 210, 7 p. (2023; Zbl 1524.05082) Full Text: DOI arXiv
Gutin, Gregory; Yeo, Anders Lower bounds for maximum weighted cut. (English) Zbl 1517.05140 SIAM J. Discrete Math. 37, No. 2, 1142-1161 (2023). MSC: 05C70 05C22 05C35 PDFBibTeX XMLCite \textit{G. Gutin} and \textit{A. Yeo}, SIAM J. Discrete Math. 37, No. 2, 1142--1161 (2023; Zbl 1517.05140) Full Text: DOI arXiv
Chimani, Markus; Juhnke-Kubitzke, Martina; Nover, Alexander; Römer, Tim Cut polytopes of minor-free graphs. (English) Zbl 07691490 Bull. Math. Soc. Sci. Math. Roum., Nouv. Sér. 66(114), No. 1, 97-112 (2023). MSC: 52B12 05C83 PDFBibTeX XMLCite \textit{M. Chimani} et al., Bull. Math. Soc. Sci. Math. Roum., Nouv. Sér. 66(114), No. 1, 97--112 (2023; Zbl 07691490) Full Text: arXiv
Fløystad, Gunnar Profunctors between posets and Alexander duality. (English) Zbl 07683084 Appl. Categ. Struct. 31, No. 2, Paper No. 22, 30 p. (2023). MSC: 06A06 18D60 13F55 PDFBibTeX XMLCite \textit{G. Fløystad}, Appl. Categ. Struct. 31, No. 2, Paper No. 22, 30 p. (2023; Zbl 07683084) Full Text: DOI arXiv
Wu, Junhao; Lu, Cheng; Li, Shaoze; Deng, Zhibin A semidefinite relaxation based global algorithm for two-level graph partition problem. (English) Zbl 1524.90273 J. Ind. Manag. Optim. 19, No. 9, 7036-7053 (2023). MSC: 90C27 90C22 90C57 05C70 90C35 PDFBibTeX XMLCite \textit{J. Wu} et al., J. Ind. Manag. Optim. 19, No. 9, 7036--7053 (2023; Zbl 1524.90273) Full Text: DOI
Liu, Xuemei; Meng, Jixiang; Sabir, Eminjan Component connectivity of the data center network dcell. (English) Zbl 1511.05116 Appl. Math. Comput. 444, Article ID 127822, 10 p. (2023). MSC: 05C40 05C90 90B10 PDFBibTeX XMLCite \textit{X. Liu} et al., Appl. Math. Comput. 444, Article ID 127822, 10 p. (2023; Zbl 1511.05116) Full Text: DOI
Bianchi, Silvia M.; Escalante, Mariana S.; Nasini, Graciela L.; Wagler, Annegret K. Lovász-Schrijver PSD-operator and the stable set polytope of claw-free graphs. (English) Zbl 1511.05053 Discrete Appl. Math. 332, 70-86 (2023). MSC: 05C10 05C75 90C35 90C10 90C57 52B05 PDFBibTeX XMLCite \textit{S. M. Bianchi} et al., Discrete Appl. Math. 332, 70--86 (2023; Zbl 1511.05053) Full Text: DOI
Forster, Sebastian; de Vos, Tijn Faster cut sparsification of weighted graphs. (English) Zbl 07673390 Algorithmica 85, No. 4, 929-964 (2023). MSC: 68Wxx 05Cxx PDFBibTeX XMLCite \textit{S. Forster} and \textit{T. de Vos}, Algorithmica 85, No. 4, 929--964 (2023; Zbl 07673390) Full Text: DOI arXiv
Chandrasekaran, Karthekeyan; Wang, Weihang Fixed parameter approximation scheme for min-max \(k\)-cut. (English) Zbl 1511.05191 Math. Program. 197, No. 2 (B), 1093-1144 (2023). Reviewer: Mehrdad Nasernejad (Lens) MSC: 05C70 05C85 68W25 PDFBibTeX XMLCite \textit{K. Chandrasekaran} and \textit{W. Wang}, Math. Program. 197, No. 2 (B), 1093--1144 (2023; Zbl 1511.05191) Full Text: DOI
Barbato, Michele; Grappe, Roland; Lacroix, Mathieu; Lancini, Emiliano Box-total dual integrality and edge-connectivity. (English) Zbl 1514.90196 Math. Program. 197, No. 1 (A), 307-336 (2023). MSC: 90C27 90C05 90C57 PDFBibTeX XMLCite \textit{M. Barbato} et al., Math. Program. 197, No. 1 (A), 307--336 (2023; Zbl 1514.90196) Full Text: DOI
Bächle, Andreas; Kiefer, Ann; Maheshwary, Sugandha; del Río, Ángel Gruenberg-Kegel graphs: cut groups, rational groups and the prime graph question. (English) Zbl 1520.16025 Forum Math. 35, No. 2, 409-429 (2023). Reviewer: Leo Margolis (Madrid) MSC: 16S34 16U60 20C05 20C15 PDFBibTeX XMLCite \textit{A. Bächle} et al., Forum Math. 35, No. 2, 409--429 (2023; Zbl 1520.16025) Full Text: DOI arXiv
Tsin, Yung H. A simple certifying algorithm for 3-edge-connectivity. (English) Zbl 1509.05169 Theor. Comput. Sci. 951, Article ID 113760, 26 p. (2023). MSC: 05C85 05C40 PDFBibTeX XMLCite \textit{Y. H. Tsin}, Theor. Comput. Sci. 951, Article ID 113760, 26 p. (2023; Zbl 1509.05169) Full Text: DOI arXiv
Andres, Bjoern; Di Gregorio, Silvia; Irmai, Jannik; Lange, Jan-Hendrik A polyhedral study of lifted multicuts. (English) Zbl 1514.90253 Discrete Optim. 47, Article ID 100757, 64 p. (2023). MSC: 90C57 52B12 90C35 PDFBibTeX XMLCite \textit{B. Andres} et al., Discrete Optim. 47, Article ID 100757, 64 p. (2023; Zbl 1514.90253) Full Text: DOI arXiv
Alencar, Jorge; de Lima, Leonardo; Nikiforov, Vladimir On graphs with eigenvectors in \(\{-1,0,1\}\) and the max \(k\)-cut problem. (English) Zbl 1508.05099 Linear Algebra Appl. 663, 222-240 (2023). MSC: 05C50 05C35 PDFBibTeX XMLCite \textit{J. Alencar} et al., Linear Algebra Appl. 663, 222--240 (2023; Zbl 1508.05099) Full Text: DOI arXiv
Gnegel, Fabian; Fügenschuh, Armin Branch-and-refine for solving time-expanded MILP formulations. (English) Zbl 1520.90196 Comput. Oper. Res. 149, Article ID 106043, 15 p. (2023). MSC: 90C35 90C11 90C57 PDFBibTeX XMLCite \textit{F. Gnegel} and \textit{A. Fügenschuh}, Comput. Oper. Res. 149, Article ID 106043, 15 p. (2023; Zbl 1520.90196) Full Text: DOI
Saraf, J. B.; Borse, Y. M.; Mundhe, Ganesh On conditional connectivity of the Cartesian product of cycles. (English) Zbl 1504.05245 Discuss. Math., Graph Theory 43, No. 1, 17-34 (2023). MSC: 05C76 05C40 68R10 PDFBibTeX XMLCite \textit{J. B. Saraf} et al., Discuss. Math., Graph Theory 43, No. 1, 17--34 (2023; Zbl 1504.05245) Full Text: DOI arXiv
Oum, Sang-il Rank connectivity and pivot-minors of graphs. (English) Zbl 1504.05177 Eur. J. Comb. 108, Article ID 103634, 19 p. (2023). MSC: 05C50 05C40 PDFBibTeX XMLCite \textit{S.-i. Oum}, Eur. J. Comb. 108, Article ID 103634, 19 p. (2023; Zbl 1504.05177) Full Text: DOI arXiv
Feghali, Carl A note on matching-cut in \(P_t\)-free graphs. (English) Zbl 07609045 Inf. Process. Lett. 179, Article ID 106294, 5 p. (2023). MSC: 68R10 05C70 68Q25 PDFBibTeX XMLCite \textit{C. Feghali}, Inf. Process. Lett. 179, Article ID 106294, 5 p. (2023; Zbl 07609045) Full Text: DOI arXiv
Samer, Phillippe; Moura, Phablo F. S. Polyhedral approach to weighted connected matchings in general graphs. arXiv:2310.05733 Preprint, arXiv:2310.05733 [cs.DM] (2023). MSC: 90C27 90C57 90C11 68R10 BibTeX Cite \textit{P. Samer} and \textit{P. F. S. Moura}, ``Polyhedral approach to weighted connected matchings in general graphs'', Preprint, arXiv:2310.05733 [cs.DM] (2023) Full Text: arXiv OA License
He, Zhiyang; Li, Jason Breaking the \(n^k\) barrier for minimum \(k\)-cut on simple graphs. (English) Zbl 07774326 Leonardi, Stefano (ed.) et al., Proceedings of the 54th annual ACM SIGACT symposium on theory of computing, STOC ’22, Rome, Italy June 20–24, 2022. New York, NY: Association for Computing Machinery (ACM). 131-136 (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{Z. He} and \textit{J. Li}, in: Proceedings of the 54th annual ACM SIGACT symposium on theory of computing, STOC '22, Rome, Italy June 20--24, 2022. New York, NY: Association for Computing Machinery (ACM). 131--136 (2022; Zbl 07774326) Full Text: DOI arXiv
Poulik, Soumitra; Ghorai, Ganesh Connectivity concepts in bipolar fuzzy incidence graphs. (English) Zbl 1524.05251 Thai J. Math. 20, No. 4, 1609-1619 (2022). MSC: 05C72 05C40 PDFBibTeX XMLCite \textit{S. Poulik} and \textit{G. Ghorai}, Thai J. Math. 20, No. 4, 1609--1619 (2022; Zbl 1524.05251) Full Text: Link
Condori, Marcos A. T.; Miranda, Paulo A. V. Differential oriented image foresting transform segmentation by seed competition. (English) Zbl 1522.68689 Baudrier, Étienne (ed.) et al., Discrete geometry and mathematical morphology. Second international joint conference, DGMM 2022, Strasbourg, France, October 24–27, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13493, 300-311 (2022). MSC: 68U10 68R10 PDFBibTeX XMLCite \textit{M. A. T. Condori} and \textit{P. A. V. Miranda}, Lect. Notes Comput. Sci. 13493, 300--311 (2022; Zbl 1522.68689) Full Text: DOI
Galby, Esther; Marx, Dániel; Schepper, Philipp; Sharma, Roohani; Tale, Prafullkumar Parameterized complexity of weighted multicut in trees. (English) Zbl 07682415 Bekos, Michael A. (ed.) et al., Graph-theoretic concepts in computer science. 48th international workshop, WG 2022, Tübingen, Germany, June 22–24, 2022. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 13453, 257-270 (2022). MSC: 68R10 PDFBibTeX XMLCite \textit{E. Galby} et al., Lect. Notes Comput. Sci. 13453, 257--270 (2022; Zbl 07682415) Full Text: DOI arXiv
Brand, Cornelius; Ceylan, Esra; Ganian, Robert; Hatschka, Christian; Korchemna, Viktoriia Edge-cut width: an algorithmically driven analogue of treewidth based on edge cuts. (English) Zbl 07682404 Bekos, Michael A. (ed.) et al., Graph-theoretic concepts in computer science. 48th international workshop, WG 2022, Tübingen, Germany, June 22–24, 2022. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 13453, 98-113 (2022). MSC: 68R10 PDFBibTeX XMLCite \textit{C. Brand} et al., Lect. Notes Comput. Sci. 13453, 98--113 (2022; Zbl 07682404) Full Text: DOI arXiv
Chandrasekaran, Karthekeyan; Chekuri, Chandra Hypergraph \(k\)-cut for fixed \(k\) in deterministic polynomial time. (English) Zbl 07639674 Math. Oper. Res. 47, No. 4, 3380-3399 (2022). MSC: 68R10 PDFBibTeX XMLCite \textit{K. Chandrasekaran} and \textit{C. Chekuri}, Math. Oper. Res. 47, No. 4, 3380--3399 (2022; Zbl 07639674) Full Text: DOI arXiv
Valizadeh, M.; Tadayon, M. H. Logical \(s\)-\(t\) min-cut problem: an extension to the classic \(s\)-\(t\) min-cut problem. (English) Zbl 1524.68245 Iran. J. Math. Sci. Inform. 17, No. 2, 253-271 (2022). MSC: 68R10 05C20 05C22 68Q17 68Q25 PDFBibTeX XMLCite \textit{M. Valizadeh} and \textit{M. H. Tadayon}, Iran. J. Math. Sci. Inform. 17, No. 2, 253--271 (2022; Zbl 1524.68245) Full Text: DOI
Nazeer, Irfan; Rashid, Tabasam Connectivity concepts in intuitionistic fuzzy incidence graphs with application. (English) Zbl 1513.05318 Int. J. Appl. Comput. Math. 8, No. 5, Paper No. 263, 15 p. (2022). MSC: 05C72 05C40 05C70 05C90 PDFBibTeX XMLCite \textit{I. Nazeer} and \textit{T. Rashid}, Int. J. Appl. Comput. Math. 8, No. 5, Paper No. 263, 15 p. (2022; Zbl 1513.05318) Full Text: DOI
Chen, Xiaodong; Guo, Xiyao; Yang, Xiwu 2-proper partition of a graph. (English) Zbl 07625284 Graphs Comb. 38, No. 6, Paper No. 191, 11 p. (2022). MSC: 68R10 PDFBibTeX XMLCite \textit{X. Chen} et al., Graphs Comb. 38, No. 6, Paper No. 191, 11 p. (2022; Zbl 07625284) Full Text: DOI
Arockiaraj, Micheal; Mushtaq, Shagufa; Klavžar, Sandi; Fiona, J. Celin; Balasubramanian, Krishnan Szeged-like topological indices and the efficacy of the cut method: the case of melem structures. (English) Zbl 1513.05069 DML, Discrete Math. Lett. 9, 49-56 (2022). MSC: 05C09 05C12 05C92 92E10 PDFBibTeX XMLCite \textit{M. Arockiaraj} et al., DML, Discrete Math. Lett. 9, 49--56 (2022; Zbl 1513.05069) Full Text: DOI
Ganian, Robert; Kim, Eun Jung; Szeider, Stefan Algorithmic applications of tree-cut width. (English) Zbl 1503.05117 SIAM J. Discrete Math. 36, No. 4, 2635-2666 (2022). MSC: 05C85 68Q25 90C05 90C10 PDFBibTeX XMLCite \textit{R. Ganian} et al., SIAM J. Discrete Math. 36, No. 4, 2635--2666 (2022; Zbl 1503.05117) Full Text: DOI arXiv
Omranian, Sara; Nikoloski, Zoran CUBCO: prediction of protein complexes based on min-cut network partitioning into biclique spanned subgraphs. (English) Zbl 1507.92029 Benito, Rosa Maria (ed.) et al., Complex networks & their applications X. Volume 2. Proceedings of the 10th international conference, COMPLEX NETWORKS 2021, Madrid, Spain, November 30 – December 2, 2021. Cham: Springer. Stud. Comput. Intell. 1016, 605-615 (2022). MSC: 92C40 92C42 PDFBibTeX XMLCite \textit{S. Omranian} and \textit{Z. Nikoloski}, Stud. Comput. Intell. 1016, 605--615 (2022; Zbl 1507.92029) Full Text: DOI
Naderi, Mohammad Javad; Buchanan, Austin; Walteros, Jose L. Worst-case analysis of clique MIPs. (English) Zbl 1504.90131 Math. Program. 195, No. 1-2 (A), 517-551 (2022). MSC: 90C27 90C10 90C57 90C35 68Q25 68Q27 68R10 PDFBibTeX XMLCite \textit{M. J. Naderi} et al., Math. Program. 195, No. 1--2 (A), 517--551 (2022; Zbl 1504.90131) Full Text: DOI
Safeera, K.; Kumar, V. Anil Vertex cut polynomial of graphs. (English) Zbl 1513.05212 Adv. Appl. Discrete Math. 32, 1-12 (2022). MSC: 05C31 05C40 PDFBibTeX XMLCite \textit{K. Safeera} and \textit{V. A. Kumar}, Adv. Appl. Discrete Math. 32, 1--12 (2022; Zbl 1513.05212) Full Text: DOI
Chen, Sheng; Dai, Yi Delta invariant for Eulerian digraphs. (English) Zbl 1510.05174 Theor. Comput. Sci. 928, 94-103 (2022). MSC: 05C50 05C45 68W40 PDFBibTeX XMLCite \textit{S. Chen} and \textit{Y. Dai}, Theor. Comput. Sci. 928, 94--103 (2022; Zbl 1510.05174) Full Text: DOI
Morawietz, Nils; Grüttemeier, Niels; Komusiewicz, Christian; Sommer, Frank Refined parameterizations for computing colored cuts in edge-colored graphs. (English) Zbl 07596191 Theory Comput. Syst. 66, No. 5, 1019-1045 (2022). MSC: 68Q27 05C15 68Q17 68R10 PDFBibTeX XMLCite \textit{N. Morawietz} et al., Theory Comput. Syst. 66, No. 5, 1019--1045 (2022; Zbl 07596191) Full Text: DOI
Bożyk, Łukasz; Defrain, Oscar; Okrasa, Karolina; Pilipczuk, Michał On objects dual to tree-cut decompositions. (English) Zbl 1497.05181 J. Comb. Theory, Ser. B 157, 401-428 (2022). MSC: 05C60 05C70 05C57 91A43 91A24 PDFBibTeX XMLCite \textit{Ł. Bożyk} et al., J. Comb. Theory, Ser. B 157, 401--428 (2022; Zbl 1497.05181) Full Text: DOI arXiv
Furini, Fabio; Ljubić, Ivana; Malaguti, Enrico; Paronuzzi, Paolo Casting light on the hidden bilevel combinatorial structure of the capacitated vertex separator problem. (English) Zbl 1503.91039 Oper. Res. 70, No. 4, 2399-2420 (2022). MSC: 91A65 91A05 05C90 90C27 PDFBibTeX XMLCite \textit{F. Furini} et al., Oper. Res. 70, No. 4, 2399--2420 (2022; Zbl 1503.91039) Full Text: DOI
Čekanová, K.; Madaras, T. On the structure of essentially-highly-connected polyhedral graphs. (English) Zbl 1497.05135 Discrete Appl. Math. 321, 308-315 (2022). MSC: 05C40 05C10 PDFBibTeX XMLCite \textit{K. Čekanová} and \textit{T. Madaras}, Discrete Appl. Math. 321, 308--315 (2022; Zbl 1497.05135) Full Text: DOI
Soliemany, Farnaz; Ghasemi, Mohsen; Varmazyar, Rezvan On the super connectivity of direct product of graphs. (English) Zbl 1504.05155 RAIRO, Oper. Res. 56, No. 4, 2767-2773 (2022). Reviewer: Elkin Vumar (Urumqi) MSC: 05C40 05C76 05C82 PDFBibTeX XMLCite \textit{F. Soliemany} et al., RAIRO, Oper. Res. 56, No. 4, 2767--2773 (2022; Zbl 1504.05155) Full Text: DOI
Van Bang Le; Telle, Jan Arne The perfect matching cut problem revisited. (English) Zbl 07579640 Theor. Comput. Sci. 931, 117-130 (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{Van Bang Le} and \textit{J. A. Telle}, Theor. Comput. Sci. 931, 117--130 (2022; Zbl 07579640) Full Text: DOI
Castonguay, Diane; Coelho, Erika M. M.; Coelho, Hebert; Nascimento, Julliano R.; Souza, Uéverton S. Perfect matching cuts partitioning a graph into complementary subgraphs. (English) Zbl 07577704 Bazgan, Cristina (ed.) et al., Combinatorial algorithms. 33rd international workshop, IWOCA 2022, Trier, Germany, June 7–9, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13270, 257-269 (2022). MSC: 68Rxx 68Wxx PDFBibTeX XMLCite \textit{D. Castonguay} et al., Lect. Notes Comput. Sci. 13270, 257--269 (2022; Zbl 07577704) Full Text: DOI arXiv
Li, Ping; Li, Xueliang Monochromatic disconnection: Erdős-Gallai-type problems and product graphs. (English) Zbl 1498.05101 J. Comb. Optim. 44, No. 1, 136-153 (2022). MSC: 05C15 05C40 05C35 05C76 PDFBibTeX XMLCite \textit{P. Li} and \textit{X. Li}, J. Comb. Optim. 44, No. 1, 136--153 (2022; Zbl 1498.05101) Full Text: DOI arXiv
Zhang, Yipei; Wang, Xiumei; Yuan, Jinjiang Bicritical graphs without removable edges. (English) Zbl 1496.05148 Discrete Appl. Math. 320, 1-10 (2022). MSC: 05C70 PDFBibTeX XMLCite \textit{Y. Zhang} et al., Discrete Appl. Math. 320, 1--10 (2022; Zbl 1496.05148) Full Text: DOI
Chandrasekaran, Karthekeyan; Wang, Weihang \(\ell_p\)-norm multiway cut. (English) Zbl 07572798 Algorithmica 84, No. 9, 2667-2701 (2022). MSC: 68Wxx 05Cxx PDFBibTeX XMLCite \textit{K. Chandrasekaran} and \textit{W. Wang}, Algorithmica 84, No. 9, 2667--2701 (2022; Zbl 07572798) Full Text: DOI arXiv
Veldt, Nate; Benson, Austin R.; Kleinberg, Jon Hypergraph cuts with general splitting functions. (English) Zbl 1494.05080 SIAM Rev. 64, No. 3, 650-685 (2022). MSC: 05C65 05C50 68R10 68Q25 90C27 PDFBibTeX XMLCite \textit{N. Veldt} et al., SIAM Rev. 64, No. 3, 650--685 (2022; Zbl 1494.05080) Full Text: DOI arXiv
Hakanen, Anni; Junnila, Ville; Laihonen, Tero; Yero, Ismael G. On vertices contained in all or in no metric basis. (English) Zbl 1494.05035 Discrete Appl. Math. 319, 407-423 (2022). MSC: 05C12 68R10 68Q25 PDFBibTeX XMLCite \textit{A. Hakanen} et al., Discrete Appl. Math. 319, 407--423 (2022; Zbl 1494.05035) Full Text: DOI arXiv
Aravind, N. R.; Kalyanasundaram, Subrahmanyam; Kare, Anjeneya Swami Vertex partitioning problems on graphs with bounded tree width. (English) Zbl 1494.05090 Discrete Appl. Math. 319, 254-270 (2022). MSC: 05C70 05C15 05C85 PDFBibTeX XMLCite \textit{N. R. Aravind} et al., Discrete Appl. Math. 319, 254--270 (2022; Zbl 1494.05090) Full Text: DOI
González-Moreno, Diego; Guevara, Mucuy-Kak; Montellano-Ballesteros, Juan José An anti-Ramsey theorem of \(k\)-restricted edge-cuts. (English) Zbl 1493.05100 Graphs Comb. 38, No. 4, Paper No. 125, 7 p. (2022). MSC: 05C15 05C35 05C40 05C55 05D10 PDFBibTeX XMLCite \textit{D. González-Moreno} et al., Graphs Comb. 38, No. 4, Paper No. 125, 7 p. (2022; Zbl 1493.05100) Full Text: DOI
Li, Shuchao; Zhou, Zihan On the \(A_\sigma\)-spectral radii of graphs with some given parameters. (English) Zbl 1497.05152 Rocky Mt. J. Math. 52, No. 3, 949-966 (2022). Reviewer: Fenglei Tian (Rizhao) MSC: 05C50 15A18 PDFBibTeX XMLCite \textit{S. Li} and \textit{Z. Zhou}, Rocky Mt. J. Math. 52, No. 3, 949--966 (2022; Zbl 1497.05152) Full Text: DOI Link
Dehmer, Matthias; Emmert-Streib, Frank; Tratnik, Niko; Žigert Pleteršek, Petra Szeged-like entropies of graphs. (English) Zbl 1510.05038 Appl. Math. Comput. 431, Article ID 127325, 10 p. (2022). MSC: 05C09 05C12 05C90 05C92 94A17 PDFBibTeX XMLCite \textit{M. Dehmer} et al., Appl. Math. Comput. 431, Article ID 127325, 10 p. (2022; Zbl 1510.05038) Full Text: DOI
Sujitha, S.; Lazer, Mary Jenitha Super edge connectivity number of an arithmetic graph. (English) Zbl 1489.05082 J. Indones. Math. Soc. 28, No. 1, 69-74 (2022). MSC: 05C40 PDFBibTeX XMLCite \textit{S. Sujitha} and \textit{M. J. Lazer}, J. Indones. Math. Soc. 28, No. 1, 69--74 (2022; Zbl 1489.05082) Full Text: Link
Pandey, Dinesh; Patra, Kamal Lochan Wiener index of graphs with fixed number of pendant or cut-vertices. (English) Zbl 07547212 Czech. Math. J. 72, No. 2, 411-431 (2022). MSC: 05C05 05C12 05C35 PDFBibTeX XMLCite \textit{D. Pandey} and \textit{K. L. Patra}, Czech. Math. J. 72, No. 2, 411--431 (2022; Zbl 07547212) Full Text: DOI arXiv
Gao, Yanhong; Li, Xueliang Monochromatic vertex-disconnection colorings of graphs. (English) Zbl 1496.05049 Bull. Malays. Math. Sci. Soc. (2) 45, No. 4, 1621-1640 (2022). Reviewer: Josef Lauri (Msida) MSC: 05C15 05C40 05C75 PDFBibTeX XMLCite \textit{Y. Gao} and \textit{X. Li}, Bull. Malays. Math. Sci. Soc. (2) 45, No. 4, 1621--1640 (2022; Zbl 1496.05049) Full Text: DOI
Oriolo, Gianpaolo; Stauffer, Gautier On the facets of stable set polytopes of circular interval graphs. (English) Zbl 1491.05158 Ann. Oper. Res. 312, No. 2, 1007-1029 (2022). MSC: 05C76 05C35 90C57 PDFBibTeX XMLCite \textit{G. Oriolo} and \textit{G. Stauffer}, Ann. Oper. Res. 312, No. 2, 1007--1029 (2022; Zbl 1491.05158) Full Text: DOI
Alimi, Morteza; Daneshgar, Amir; Foroughmand-Araabi, Mohammad-Hadi Mean isoperimetry with control on outliers: exact and approximation algorithms. (English) Zbl 07540249 Theor. Comput. Sci. 923, 348-365 (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{M. Alimi} et al., Theor. Comput. Sci. 923, 348--365 (2022; Zbl 07540249) Full Text: DOI arXiv
Campêlo, Manoel; Freire, Alexandre S.; Moura, Phablo F. S.; Soares, Joel C. Strong inequalities and a branch-and-price algorithm for the convex recoloring problem. (English) Zbl 1507.05031 Eur. J. Oper. Res. 303, No. 1, 54-65 (2022). MSC: 05C15 05C85 90C57 PDFBibTeX XMLCite \textit{M. Campêlo} et al., Eur. J. Oper. Res. 303, No. 1, 54--65 (2022; Zbl 1507.05031) Full Text: DOI
Maksimenko, A. N. Affine maps between quadratic assignment polytopes and subgraph isomorphism polytopes. (English) Zbl 1490.52011 J. Discrete Math. Sci. Cryptography 25, No. 2, 503-509 (2022). MSC: 52B12 90C57 PDFBibTeX XMLCite \textit{A. N. Maksimenko}, J. Discrete Math. Sci. Cryptography 25, No. 2, 503--509 (2022; Zbl 1490.52011) Full Text: DOI arXiv
Rodrigues de Sousa, Vilmar Jefté; Anjos, Miguel F.; Le Digabel, Sébastien Computational study of a branching algorithm for the maximum \(k\)-cut problem. (English) Zbl 1506.90233 Discrete Optim. 44, Part 2, Article ID 100656, 20 p. (2022). MSC: 90C27 90C22 90C57 PDFBibTeX XMLCite \textit{V. J. Rodrigues de Sousa} et al., Discrete Optim. 44, Part 2, Article ID 100656, 20 p. (2022; Zbl 1506.90233) Full Text: DOI
Coja-Oghlan, Amin; Loick, Philipp; Mezei, Balázs F.; Sorkin, Gregory B. The Ising antiferromagnet and max cut on random regular graphs. (English) Zbl 07537559 SIAM J. Discrete Math. 36, No. 2, 1306-1342 (2022). MSC: 82-XX 05C80 PDFBibTeX XMLCite \textit{A. Coja-Oghlan} et al., SIAM J. Discrete Math. 36, No. 2, 1306--1342 (2022; Zbl 07537559) Full Text: DOI arXiv
Chen, Yulan; Lin, Yuqing; Yan, Weigen The super-connectivity of the Kneser graph \(KG(n,3)\). (English) Zbl 1490.05138 Australas. J. Comb. 82, Part 2, 201-211 (2022). MSC: 05C40 PDFBibTeX XMLCite \textit{Y. Chen} et al., Australas. J. Comb. 82, Part 2, 201--211 (2022; Zbl 1490.05138) Full Text: arXiv Link
Zhang, Wanping; Meng, Jixiang; Wu, Baoyindureng Extremal graphs with respect to two distance-based topological indices. (English) Zbl 1490.05053 Discrete Appl. Math. 317, 63-74 (2022). MSC: 05C09 05C12 05C35 05C92 92E10 PDFBibTeX XMLCite \textit{W. Zhang} et al., Discrete Appl. Math. 317, 63--74 (2022; Zbl 1490.05053) Full Text: DOI
Gutekunst, Samuel C.; Williamson, David P. Semidefinite programming relaxations of the traveling salesman problem and their integrality gaps. (English) Zbl 1492.90146 Math. Oper. Res. 47, No. 1, 1-28 (2022). MSC: 90C27 90C22 90C57 05C85 68R05 68W25 PDFBibTeX XMLCite \textit{S. C. Gutekunst} and \textit{D. P. Williamson}, Math. Oper. Res. 47, No. 1, 1--28 (2022; Zbl 1492.90146) Full Text: DOI arXiv
Bergougnoux, Benjamin; Papadopoulos, Charis; Telle, Jan Arne Node multiway cut and subset feedback vertex set on graphs of bounded mim-width. (English) Zbl 07517140 Algorithmica 84, No. 5, 1385-1417 (2022). MSC: 68Wxx 05Cxx PDFBibTeX XMLCite \textit{B. Bergougnoux} et al., Algorithmica 84, No. 5, 1385--1417 (2022; Zbl 07517140) Full Text: DOI arXiv
Doležal, Martin; Grebík, Jan; Hladký, Jan; Rocha, Israel; Rozhoň, Václav Cut distance identifying graphon parameters over weak* limits. (English) Zbl 1486.05276 J. Comb. Theory, Ser. A 189, Article ID 105615, 57 p. (2022). MSC: 05C80 05C35 05C50 60C05 PDFBibTeX XMLCite \textit{M. Doležal} et al., J. Comb. Theory, Ser. A 189, Article ID 105615, 57 p. (2022; Zbl 1486.05276) Full Text: DOI