Galby, Esther The complexity of blocking (semi)total dominating sets with edge contractions. (English) Zbl 07664330 Theor. Comput. Sci. 950, Article ID 113678, 33 p. (2023). MSC: 68R10 05C69 68Q25 PDF BibTeX XML Cite \textit{E. Galby}, Theor. Comput. Sci. 950, Article ID 113678, 33 p. (2023; Zbl 07664330) Full Text: DOI arXiv OpenURL
Vazifedan, Afrooz; Izadi, Mohammad A dynamic graph model of strategy learning for predicting human behavior in repeated games. (English) Zbl 07663763 B. E. J. Theor. Econ. 23, No. 1, 371-403 (2023). MSC: 91A20 91A26 91A43 PDF BibTeX XML Cite \textit{A. Vazifedan} and \textit{M. Izadi}, B. E. J. Theor. Econ. 23, No. 1, 371--403 (2023; Zbl 07663763) Full Text: DOI OpenURL
Graf, Lukas; Harks, Tobias A finite time combinatorial algorithm for instantaneous dynamic equilibrium flows. (English) Zbl 07662916 Math. Program. 197, No. 2 (B), 761-792 (2023). MSC: 90Bxx 05C82 05C21 90C35 68Q25 PDF BibTeX XML Cite \textit{L. Graf} and \textit{T. Harks}, Math. Program. 197, No. 2 (B), 761--792 (2023; Zbl 07662916) Full Text: DOI OpenURL
Cranston, Daniel W.; Lafferty, Michael; Song, Zi-Xia A note on odd colorings of 1-planar graphs. (English) Zbl 07662546 Discrete Appl. Math. 330, 112-117 (2023). MSC: 05C15 05C10 68Rxx 68Wxx PDF BibTeX XML Cite \textit{D. W. Cranston} et al., Discrete Appl. Math. 330, 112--117 (2023; Zbl 07662546) Full Text: DOI arXiv OpenURL
Marino, Andrea; Silva, Ana Eulerian walks in temporal graphs. (English) Zbl 07661314 Algorithmica 85, No. 3, 805-830 (2023). MSC: 68R10 05C45 05C85 68Q27 PDF BibTeX XML Cite \textit{A. Marino} and \textit{A. Silva}, Algorithmica 85, No. 3, 805--830 (2023; Zbl 07661314) Full Text: DOI OpenURL
Di Marco, Niccoló; Frosini, Andrea; Kocay, William Lawrence; Pergola, Elisa; Tarsissi, Lama Structure and complexity of 2-intersection graphs of 3-hypergraphs. (English) Zbl 07661311 Algorithmica 85, No. 3, 745-761 (2023). MSC: 05C65 05C22 05C85 05C76 05C78 PDF BibTeX XML Cite \textit{N. Di Marco} et al., Algorithmica 85, No. 3, 745--761 (2023; Zbl 07661311) Full Text: DOI OpenURL
Cameron, Ben; Sawada, Joe; Therese, Wei; Williams, Aaron Hamiltonicity of \(k\)-sided pancake networks with fixed-spin: efficient generation, ranking, and optimality. (English) Zbl 07661310 Algorithmica 85, No. 3, 717-744 (2023). Reviewer: Hang Lau (Montréal) MSC: 05C45 05C85 PDF BibTeX XML Cite \textit{B. Cameron} et al., Algorithmica 85, No. 3, 717--744 (2023; Zbl 07661310) Full Text: DOI OpenURL
Arroyo, Alan; Klute, Fabian; Parada, Irene; Vogtenhuber, Birgit; Seidel, Raimund; Wiedera, Tilo Inserting one edge into a simple drawing is hard. (English) Zbl 07661297 Discrete Comput. Geom. 69, No. 3, 745-770 (2023). MSC: 68R10 05C10 PDF BibTeX XML Cite \textit{A. Arroyo} et al., Discrete Comput. Geom. 69, No. 3, 745--770 (2023; Zbl 07661297) Full Text: DOI OpenURL
Bai, Yuhang; Guo, Zhiwei; Zhang, Shenggui; Bai, Yandong Linear amortized time enumeration algorithms for compatible Euler trails in edge-colored graphs. (English) Zbl 07660686 J. Comb. Optim. 45, No. 2, Paper No. 73, 20 p. (2023). MSC: 90Cxx 05C15 05C30 05C45 05C85 PDF BibTeX XML Cite \textit{Y. Bai} et al., J. Comb. Optim. 45, No. 2, Paper No. 73, 20 p. (2023; Zbl 07660686) Full Text: DOI OpenURL
Blažej, Václav; Choudhary, Pratibha; Knop, Dušan; Křišťan, Jan Matyáš; Suchý, Ondřej; Valla, Tomáš Constant factor approximation for tracking paths and fault tolerant feedback vertex set. (English) Zbl 07659165 Discrete Optim. 47, Article ID 100756, 16 p. (2023). MSC: 05C22 68W25 68Q25 90C27 PDF BibTeX XML Cite \textit{V. Blažej} et al., Discrete Optim. 47, Article ID 100756, 16 p. (2023; Zbl 07659165) Full Text: DOI OpenURL
Lee, Jae baek; Noel, Jonathan A.; Siggers, Mark Recolouring homomorphisms to triangle-free reflexive graphs. (English) Zbl 07658976 J. Algebr. Comb. 57, No. 1, 53-73 (2023). MSC: 05C15 05C85 PDF BibTeX XML Cite \textit{J. b. Lee} et al., J. Algebr. Comb. 57, No. 1, 53--73 (2023; Zbl 07658976) Full Text: DOI arXiv OpenURL
Chandran, L. Sunil; Das, Sajal K.; Hell, Pavol; Padinhatteeri, Sajith; Pillai, Raji R. Template-driven rainbow coloring of proper interval graphs. (English) Zbl 07656391 Discrete Appl. Math. 328, 97-107 (2023). MSC: 05C15 68R10 68W10 68M14 68P05 PDF BibTeX XML Cite \textit{L. S. Chandran} et al., Discrete Appl. Math. 328, 97--107 (2023; Zbl 07656391) Full Text: DOI OpenURL
Mescoff, Guillaume; Paul, Christophe; Thilikos, Dimitrios M. The mixed search game against an agile and visible fugitive is monotone. (English) Zbl 07655654 Discrete Math. 346, No. 4, Article ID 113345, 13 p. (2023). MSC: 05C57 91A43 91A05 91A24 05C76 68Q25 68R10 68P10 PDF BibTeX XML Cite \textit{G. Mescoff} et al., Discrete Math. 346, No. 4, Article ID 113345, 13 p. (2023; Zbl 07655654) Full Text: DOI arXiv OpenURL
Li, Yanjia; Spirkl, Sophie The \(r\)-coloring and maximum stable set problem in hypergraphs with bounded matching number and edge size. (English) Zbl 07655653 Discrete Math. 346, No. 4, Article ID 113342, 14 p. (2023). MSC: 05C15 05C65 05C85 68Q25 PDF BibTeX XML Cite \textit{Y. Li} and \textit{S. Spirkl}, Discrete Math. 346, No. 4, Article ID 113342, 14 p. (2023; Zbl 07655653) Full Text: DOI arXiv OpenURL
Fulek, Radoslav; Pelsmajer, Michael J.; Schaefer, Marcus Hanani-Tutte for radial planarity. II. (English) Zbl 07655009 Electron. J. Comb. 30, No. 1, Research Paper P1.14, 26 p. (2023). MSC: 05C62 05C10 05C85 68R10 PDF BibTeX XML Cite \textit{R. Fulek} et al., Electron. J. Comb. 30, No. 1, Research Paper P1.14, 26 p. (2023; Zbl 07655009) Full Text: DOI OpenURL
Bernshteyn, Anton Probabilistic constructions in continuous combinatorics and a bridge to distributed algorithms. (English) Zbl 07654575 Adv. Math. 415, Article ID 108895, 33 p. (2023). MSC: 03E15 05C15 37B10 68W15 05C63 PDF BibTeX XML Cite \textit{A. Bernshteyn}, Adv. Math. 415, Article ID 108895, 33 p. (2023; Zbl 07654575) Full Text: DOI arXiv OpenURL
Gaspers, Serge; Lee, Edward J. Faster graph coloring in polynomial space. (English) Zbl 07654497 Algorithmica 85, No. 2, 584-609 (2023). MSC: 68R10 05C15 05C85 68W40 PDF BibTeX XML Cite \textit{S. Gaspers} and \textit{E. J. Lee}, Algorithmica 85, No. 2, 584--609 (2023; Zbl 07654497) Full Text: DOI OpenURL
Bliznets, Ivan; Sagunov, Danil Solving target set selection with bounded thresholds faster than \(2^n\). (English) Zbl 07654490 Algorithmica 85, No. 2, 384-405 (2023). MSC: 68R10 68Q27 PDF BibTeX XML Cite \textit{I. Bliznets} and \textit{D. Sagunov}, Algorithmica 85, No. 2, 384--405 (2023; Zbl 07654490) Full Text: DOI OpenURL
Halldórsson, Magnús M.; Nolin, Alexandre Superfast coloring in CONGEST via efficient color sampling. (English) Zbl 07653188 Theor. Comput. Sci. 948, Article ID 113711, 13 p. (2023). MSC: 68R10 05C15 68W15 68W20 PDF BibTeX XML Cite \textit{M. M. Halldórsson} and \textit{A. Nolin}, Theor. Comput. Sci. 948, Article ID 113711, 13 p. (2023; Zbl 07653188) Full Text: DOI OpenURL
Ducoffe, Guillaume Distance problems within Helly graphs and \(k\)-Helly graphs. (English) Zbl 07648687 Theor. Comput. Sci. 946, Article ID 113690, 11 p. (2023). MSC: 68Qxx PDF BibTeX XML Cite \textit{G. Ducoffe}, Theor. Comput. Sci. 946, Article ID 113690, 11 p. (2023; Zbl 07648687) Full Text: DOI arXiv OpenURL
Jordán, Tibor Rigid block and hole graphs with a single block. (English) Zbl 07643138 Discrete Math. 346, No. 3, Article ID 113268, 7 p. (2023). MSC: 05B35 05B05 05C10 05C85 52B40 PDF BibTeX XML Cite \textit{T. Jordán}, Discrete Math. 346, No. 3, Article ID 113268, 7 p. (2023; Zbl 07643138) Full Text: DOI OpenURL
Cordero-Michel, Narda; Galeana-Sánchez, Hortensia; Goldfeder, Ilan A. Cycles and new bounds for the chromatic number. (English) Zbl 07643128 Discrete Math. 346, No. 3, Article ID 113255, 9 p. (2023). MSC: 05C15 05C38 05C85 PDF BibTeX XML Cite \textit{N. Cordero-Michel} et al., Discrete Math. 346, No. 3, Article ID 113255, 9 p. (2023; Zbl 07643128) Full Text: DOI OpenURL
Bal, Deepak; Bennett, Patrick The matching process and independent process in random regular graphs and hypergraphs. (English) Zbl 07642889 Electron. J. Comb. 30, No. 1, Research Paper P1.11, 28 p. (2023). Reviewer: Nicolás Sanhueza-Matamala (Praha) MSC: 05C70 05C65 05C80 05C85 05C30 PDF BibTeX XML Cite \textit{D. Bal} and \textit{P. Bennett}, Electron. J. Comb. 30, No. 1, Research Paper P1.11, 28 p. (2023; Zbl 07642889) Full Text: DOI arXiv OpenURL
Ding, Jintai; Kim, Seungki; Takagi, Tsuyoshi; Wang, Yuntao; Yang, Bo-yin A physical study of the LLL algorithm. (English) Zbl 07641109 J. Number Theory 244, 339-368 (2023). MSC: 11Y16 94A60 82C20 68Q25 PDF BibTeX XML Cite \textit{J. Ding} et al., J. Number Theory 244, 339--368 (2023; Zbl 07641109) Full Text: DOI arXiv OpenURL
Maffucci, Riccardo W. Self-dual polyhedra of given degree sequence. (English) Zbl 1502.05234 Art Discrete Appl. Math. 6, No. 1, Paper No. P1.04, 12 p. (2023). MSC: 05C85 05C07 05C35 05C10 52B05 52B10 52C25 PDF BibTeX XML Cite \textit{R. W. Maffucci}, Art Discrete Appl. Math. 6, No. 1, Paper No. P1.04, 12 p. (2023; Zbl 1502.05234) Full Text: DOI arXiv OpenURL
Jowhari, Hossein An estimator for matching size in low arboricity graphs with two applications. (English) Zbl 07625357 J. Comb. Optim. 45, No. 1, Paper No. 21, 14 p. (2023). MSC: 90C27 90C35 90C59 PDF BibTeX XML Cite \textit{H. Jowhari}, J. Comb. Optim. 45, No. 1, Paper No. 21, 14 p. (2023; Zbl 07625357) Full Text: DOI arXiv OpenURL
Geelen, Jim; Kwon, O-joung; McCarty, Rose; Wollan, Paul The grid theorem for vertex-minors. (English) Zbl 07622600 J. Comb. Theory, Ser. B 158, Part 1, 93-116 (2023). MSC: 05C83 05C85 05C10 05C60 PDF BibTeX XML Cite \textit{J. Geelen} et al., J. Comb. Theory, Ser. B 158, Part 1, 93--116 (2023; Zbl 07622600) Full Text: DOI arXiv OpenURL
Dvořák, Zdeněk; Kawarabayashi, Ken-ichi Additive non-approximability of chromatic number in proper minor-closed classes. (English) Zbl 1503.05102 J. Comb. Theory, Ser. B 158, Part 1, 74-92 (2023). MSC: 05C75 05C15 05C85 68Q25 68W25 PDF BibTeX XML Cite \textit{Z. Dvořák} and \textit{K.-i. Kawarabayashi}, J. Comb. Theory, Ser. B 158, Part 1, 74--92 (2023; Zbl 1503.05102) Full Text: DOI OpenURL
Bentert, Matthias; Koana, Tomohiro; Niedermeier, Rolf The complexity of gerrymandering over graphs: paths and trees. (English) Zbl 1502.91049 Discrete Appl. Math. 324, 103-112 (2023). MSC: 91F10 05C90 68Q25 PDF BibTeX XML Cite \textit{M. Bentert} et al., Discrete Appl. Math. 324, 103--112 (2023; Zbl 1502.91049) Full Text: DOI OpenURL
Binucci, Carla; Didimo, Walter; Montecchiani, Fabrizio 1-planarity testing and embedding: an experimental study. (English) Zbl 1498.05260 Comput. Geom. 108, Article ID 101900, 11 p. (2023). MSC: 05C85 05C10 05C42 68R10 68Q25 PDF BibTeX XML Cite \textit{C. Binucci} et al., Comput. Geom. 108, Article ID 101900, 11 p. (2023; Zbl 1498.05260) Full Text: DOI OpenURL
Hu, Simone; Schnetz, Oliver; Shaw, Jim; Yeats, Karen Further investigations into the graph theory of \(\phi^4\)-periods and the \(c_2\) invariant. (English) Zbl 07665073 Ann. Inst. Henri Poincaré D, Comb. Phys. Interact. (AIHPD) 9, No. 3, 473-524 (2022). MSC: 81Q30 81T18 05C85 05C31 PDF BibTeX XML Cite \textit{S. Hu} et al., Ann. Inst. Henri Poincaré D, Comb. Phys. Interact. (AIHPD) 9, No. 3, 473--524 (2022; Zbl 07665073) Full Text: DOI arXiv OpenURL
Fialho, Paula M. S.; de Lima, Bernardo N. B.; Procacci, Aldo Moser-Tardos resampling algorithm, entropy compression method and the subset gas. (English) Zbl 07665072 Ann. Inst. Henri Poincaré D, Comb. Phys. Interact. (AIHPD) 9, No. 3, 435-471 (2022). MSC: 60C05 05D40 05C15 82B20 68W20 PDF BibTeX XML Cite \textit{P. M. S. Fialho} et al., Ann. Inst. Henri Poincaré D, Comb. Phys. Interact. (AIHPD) 9, No. 3, 435--471 (2022; Zbl 07665072) Full Text: DOI arXiv OpenURL
Bagheri Gh., Behrooz; Feder, Tomas; Fleischner, Herbert; Subi, Carlos On finding Hamiltonian cycles in Barnette graphs. (English) Zbl 07661120 Fundam. Inform. 188, No. 1, 1-14 (2022). MSC: 68R10 05C45 68Q25 PDF BibTeX XML Cite \textit{B. Bagheri Gh.} et al., Fundam. Inform. 188, No. 1, 1--14 (2022; Zbl 07661120) Full Text: DOI arXiv OpenURL
Ceballos, Manuel; Núñez, Juan; Tenorio, Ángel F. Finite-dimensional Zinbiel algebras and combinatorial structures. (English) Zbl 07660105 An. Științ. Univ. “Ovidius” Constanța, Ser. Mat. 30, No. 3, 67-96 (2022). MSC: 17A32 05C20 05C25 05C85 05C90 68W30 68R10 PDF BibTeX XML Cite \textit{M. Ceballos} et al., An. Științ. Univ. ``Ovidius'' Constanța, Ser. Mat. 30, No. 3, 67--96 (2022; Zbl 07660105) Full Text: DOI OpenURL
Malyshev, D. S.; Duginov, O. I. Some cases of polynomial solvability for the edge colorability problem generated by forbidden 8-edge subcubic forests. (Russian. English summary) Zbl 07656024 Diskretn. Anal. Issled. Oper. 29, No. 2, 38-61 (2022). MSC: 05C15 68Q25 PDF BibTeX XML Cite \textit{D. S. Malyshev} and \textit{O. I. Duginov}, Diskretn. Anal. Issled. Oper. 29, No. 2, 38--61 (2022; Zbl 07656024) Full Text: DOI MNR OpenURL
Voroshilov, V. V. Complexity of the max cut problem with the minimal domination constraint. (Russian. English summary) Zbl 07656016 Diskretn. Anal. Issled. Oper. 29, No. 1, 5-17 (2022). MSC: 68R10 05C22 05C69 68Q25 90C35 PDF BibTeX XML Cite \textit{V. V. Voroshilov}, Diskretn. Anal. Issled. Oper. 29, No. 1, 5--17 (2022; Zbl 07656016) Full Text: DOI MNR OpenURL
Aoudi, Mohamed Habib Aliou Diallo; Moyal, Pascal; Robin, Vincent Markovian online matching algorithms on large bipartite random graphs. (English) Zbl 07655088 Methodol. Comput. Appl. Probab. 24, No. 4, 3195-3225 (2022). MSC: 05C80 05C70 05C85 68W27 PDF BibTeX XML Cite \textit{M. H. A. D. Aoudi} et al., Methodol. Comput. Appl. Probab. 24, No. 4, 3195--3225 (2022; Zbl 07655088) Full Text: DOI arXiv OpenURL
Sun, Yuefang; Gutin, Gregory; Zhang, Xiaoyan Packing strong subgraph in digraphs. (English) Zbl 07654024 Discrete Optim. 46, Article ID 100745, 12 p. (2022). MSC: 05C20 05C70 05C85 PDF BibTeX XML Cite \textit{Y. Sun} et al., Discrete Optim. 46, Article ID 100745, 12 p. (2022; Zbl 07654024) Full Text: DOI arXiv OpenURL
Ivanov, B. N. A direct method for calculating cell cycles of a block map of a simple planar graph. (Russian. English summary) Zbl 07643918 Prikl. Diskretn. Mat. 2022, No. 58, 69-83 (2022). MSC: 05C10 05C38 05B05 05C85 PDF BibTeX XML Cite \textit{B. N. Ivanov}, Prikl. Diskretn. Mat. 2022, No. 58, 69--83 (2022; Zbl 07643918) Full Text: DOI MNR OpenURL
Lobov, Aleksandr Andreevich; Abrosimov, Mikhail Borisovich Vertex extensions of 4-layer graphs and hypercubes. (Russian. English summary) Zbl 07643098 Izv. Sarat. Univ. (N.S.), Ser. Mat. Mekh. Inform. 22, No. 4, 536-548 (2022). MSC: 05C60 05C85 PDF BibTeX XML Cite \textit{A. A. Lobov} and \textit{M. B. Abrosimov}, Izv. Sarat. Univ. (N.S.), Ser. Mat. Mekh. Inform. 22, No. 4, 536--548 (2022; Zbl 07643098) Full Text: DOI MNR OpenURL
Lahiri, Abhiruk; Mukherjee, Joydeep; Subramanian, C. R. On approximating MIS over \(B_1\)-VPG graphs. (English) Zbl 07633907 Discrete Math. Algorithms Appl. 14, No. 7, Article ID 2250035, 13 p. (2022). MSC: 68W25 05C69 05C10 90C27 PDF BibTeX XML Cite \textit{A. Lahiri} et al., Discrete Math. Algorithms Appl. 14, No. 7, Article ID 2250035, 13 p. (2022; Zbl 07633907) Full Text: DOI OpenURL
Singhwal, Nitisha; Reddy, Palagiri Venkata Subba Total vertex-edge domination in graphs: complexity and algorithms. (English) Zbl 1502.05195 Discrete Math. Algorithms Appl. 14, No. 7, Article ID 2250031, 10 p. (2022). MSC: 05C69 68Q25 PDF BibTeX XML Cite \textit{N. Singhwal} and \textit{P. V. S. Reddy}, Discrete Math. Algorithms Appl. 14, No. 7, Article ID 2250031, 10 p. (2022; Zbl 1502.05195) Full Text: DOI OpenURL
Bérczi, Kristóf; Mnich, Matthias; Vincze, Roland A 3/2-approximation for the metric many-visits path TSP. (English) Zbl 07630938 SIAM J. Discrete Math. 36, No. 4, 2995-3030 (2022). MSC: 90C27 90C35 90C59 05C85 05B35 PDF BibTeX XML Cite \textit{K. Bérczi} et al., SIAM J. Discrete Math. 36, No. 4, 2995--3030 (2022; Zbl 07630938) Full Text: DOI arXiv OpenURL
Yuan, A.; Calder, J.; Osting, B. A continuum limit for the PageRank algorithm. (English) Zbl 07629691 Eur. J. Appl. Math. 33, No. 3, 472-504 (2022). MSC: 35J15 35R02 35D40 PDF BibTeX XML Cite \textit{A. Yuan} et al., Eur. J. Appl. Math. 33, No. 3, 472--504 (2022; Zbl 07629691) Full Text: DOI arXiv OpenURL
Heuer, Karl; Steiner, Raphael; Wiederrecht, Sebastian Even circuits in oriented matroids. (English) Zbl 1498.05047 Combinatorial Theory 2, No. 1, Paper No. 3, 32 p. (2022). MSC: 05B35 05C20 05C70 05C75 05C83 05C85 52C40 PDF BibTeX XML Cite \textit{K. Heuer} et al., Comb. Theory 2, No. 1, Paper No. 3, 32 p. (2022; Zbl 1498.05047) Full Text: DOI arXiv OpenURL
Göke, Alexander; Koenemann, Jochen; Mnich, Matthias; Sun, Hao Hitting weighted even cycles in planar graphs. (English) Zbl 07617253 SIAM J. Discrete Math. 36, No. 4, 2830-2862 (2022). Reviewer: K. Subramani (Morgantown) MSC: 05C85 05D15 68W25 05C38 05C10 90C05 90C27 PDF BibTeX XML Cite \textit{A. Göke} et al., SIAM J. Discrete Math. 36, No. 4, 2830--2862 (2022; Zbl 07617253) Full Text: DOI arXiv OpenURL
Bougeret, Marin; Jansen, Bart M. P.; Sau, Ignasi Bridge-depth characterizes which minor-closed structural parameterizations of vertex cover admit a polynomial kernel. (English) Zbl 1503.05095 SIAM J. Discrete Math. 36, No. 4, 2737-2773 (2022). MSC: 05C70 05C85 05C83 05C75 PDF BibTeX XML Cite \textit{M. Bougeret} et al., SIAM J. Discrete Math. 36, No. 4, 2737--2773 (2022; Zbl 1503.05095) Full Text: DOI arXiv OpenURL
Ducoffe, Guillaume; Habib, Michel; Viennot, Laurent Diameter, eccentricities and distance oracle computations on \(H\)-minor free graphs and graphs of bounded (distance) Vapnik-Chervonenkis dimension. (English) Zbl 07617234 SIAM J. Comput. 51, No. 5, 1506-1534 (2022). MSC: 05C85 05C12 05C10 05C62 05C83 68Q25 68W20 68W40 05C65 PDF BibTeX XML Cite \textit{G. Ducoffe} et al., SIAM J. Comput. 51, No. 5, 1506--1534 (2022; Zbl 07617234) Full Text: DOI OpenURL
Hull, Thomas C.; Morales, Manuel; Nash, Sarah; Ter-Saakov, Natalya Maximal origami flip graphs of flat-foldable vertices: properties and algorithms. (English) Zbl 1498.05190 J. Graph Algorithms Appl. 26, No. 4, 503-517 (2022). MSC: 05C62 05C10 05C85 PDF BibTeX XML Cite \textit{T. C. Hull} et al., J. Graph Algorithms Appl. 26, No. 4, 503--517 (2022; Zbl 1498.05190) Full Text: DOI arXiv OpenURL
Bekos, Michael A.; Binucci, Carla; Di Battista, Giuseppe; Didimo, Walter; Gronemann, Martin; Klein, Karsten; Patrignani, Maurizio; Rutter, Ignaz On turn-regular orthogonal representations. (English) Zbl 1498.05189 J. Graph Algorithms Appl. 26, No. 3, 285-306 (2022). MSC: 05C62 05C10 68R10 05C85 PDF BibTeX XML Cite \textit{M. A. Bekos} et al., J. Graph Algorithms Appl. 26, No. 3, 285--306 (2022; Zbl 1498.05189) Full Text: DOI OpenURL
Hanaka, Tesshu; Kawai, Kazuma; Ono, Hirotaka Computing \(L(p, 1)\)-labeling with combined parameters. (English) Zbl 1498.05233 J. Graph Algorithms Appl. 26, No. 2, 241-255 (2022). MSC: 05C78 05C85 68Q27 PDF BibTeX XML Cite \textit{T. Hanaka} et al., J. Graph Algorithms Appl. 26, No. 2, 241--255 (2022; Zbl 1498.05233) Full Text: DOI OpenURL
Biniaz, Ahmad Better approximation algorithms for maximum weight internal spanning trees in cubic graphs and claw-free graphs. (English) Zbl 1498.05259 J. Graph Algorithms Appl. 26, No. 2, 209-224 (2022). MSC: 05C85 68W25 05C22 68R10 PDF BibTeX XML Cite \textit{A. Biniaz}, J. Graph Algorithms Appl. 26, No. 2, 209--224 (2022; Zbl 1498.05259) Full Text: DOI OpenURL
Contat, Alice Surprising identities for the greedy independent set on Cayley trees. (English) Zbl 1503.05055 J. Appl. Probab. 59, No. 4, 1042-1058 (2022). MSC: 05C25 05C80 05C05 68W20 60J10 PDF BibTeX XML Cite \textit{A. Contat}, J. Appl. Probab. 59, No. 4, 1042--1058 (2022; Zbl 1503.05055) Full Text: DOI arXiv OpenURL
Dombi, Erzsébet Closed trail decompositions on grid graphs. (English) Zbl 07614107 PU.M.A., Pure Math. Appl. 30, No. 2, 71-84 (2022). MSC: 05C70 05C85 PDF BibTeX XML Cite \textit{E. Dombi}, PU.M.A., Pure Math. Appl. 30, No. 2, 71--84 (2022; Zbl 07614107) Full Text: DOI OpenURL
Millani, Marcelo Garlet; Steiner, Raphael; Wiederrecht, Sebastian Colouring non-even digraphs. (English) Zbl 1503.05044 Electron. J. Comb. 29, No. 4, Research Paper P4.9, 40 p. (2022). Reviewer: V. Yegnanarayanan (Chennai) MSC: 05C15 05C20 05C10 05C70 05C72 05C83 05C85 68Q17 PDF BibTeX XML Cite \textit{M. G. Millani} et al., Electron. J. Comb. 29, No. 4, Research Paper P4.9, 40 p. (2022; Zbl 1503.05044) Full Text: DOI arXiv OpenURL
Zorzi, A.; Figueiredo, C. M. H.; Machado, R. C. S.; Zatesko, L. M.; Souza, U. S. Compositions, decompositions, and conformability for total coloring on power of cycle graphs. (English) Zbl 1502.05079 Discrete Appl. Math. 323, 349-363 (2022). MSC: 05C15 05C85 68Q25 68R10 PDF BibTeX XML Cite \textit{A. Zorzi} et al., Discrete Appl. Math. 323, 349--363 (2022; Zbl 1502.05079) Full Text: DOI OpenURL
Groshaus, M.; Guedes, A. L. P.; Puppo, J. P. Biclique graphs of split graphs. (English) Zbl 1502.05106 Discrete Appl. Math. 323, 252-267 (2022). MSC: 05C38 05C45 68Q25 PDF BibTeX XML Cite \textit{M. Groshaus} et al., Discrete Appl. Math. 323, 252--267 (2022; Zbl 1502.05106) Full Text: DOI OpenURL
de Lima, Alane M.; da Silva, Murilo V. G.; Vignatti, André L. Percolation centrality via Rademacher Complexity. (English) Zbl 1502.05088 Discrete Appl. Math. 323, 201-216 (2022). MSC: 05C22 05C85 05C82 68W25 PDF BibTeX XML Cite \textit{A. M. de Lima} et al., Discrete Appl. Math. 323, 201--216 (2022; Zbl 1502.05088) Full Text: DOI OpenURL
Abreu, Alexandre; Cunha, Luís; Figueiredo, Celina; Marquezino, Franklin; Posner, Daniel; Portugal, Renato Total tessellation cover: bounds, hardness, and applications. (English) Zbl 1502.05197 Discrete Appl. Math. 323, 149-161 (2022). MSC: 05C70 05B45 05C75 68Q17 PDF BibTeX XML Cite \textit{A. Abreu} et al., Discrete Appl. Math. 323, 149--161 (2022; Zbl 1502.05197) Full Text: DOI OpenURL
Saxena, Smriti; Thapar, Antika; Bansal, Richa Total fuzzy graph coloring. (English) Zbl 1498.05106 J. Hyperstruct. 11, No. 1, 84-108 (2022). MSC: 05C15 05C72 05C85 PDF BibTeX XML Cite \textit{S. Saxena} et al., J. Hyperstruct. 11, No. 1, 84--108 (2022; Zbl 1498.05106) Full Text: Link OpenURL
Afkhami, Mojgan; Khashyarmanesh, Kazem; Tavakoli, Mostafa \(l\)-clique metric dimension of graphs. (English) Zbl 07610153 Bull. Malays. Math. Sci. Soc. (2) 45, No. 6, 2865-2883 (2022). Reviewer: Sandi Klavžar (Ljubljana) MSC: 05C12 05C25 05C76 90C10 68Q25 PDF BibTeX XML Cite \textit{M. Afkhami} et al., Bull. Malays. Math. Sci. Soc. (2) 45, No. 6, 2865--2883 (2022; Zbl 07610153) Full Text: DOI OpenURL
Zou, Peng; Qingge, Letu; Yang, Qing; Zhu, Binhai Computing a consensus trajectory in a vehicular network. (English) Zbl 07610142 J. Comb. Optim. 44, No. 5, 3575-3594 (2022). MSC: 90B10 68Q25 90C35 05C35 68W25 PDF BibTeX XML Cite \textit{P. Zou} et al., J. Comb. Optim. 44, No. 5, 3575--3594 (2022; Zbl 07610142) Full Text: DOI OpenURL
Kumar, R. Mahendra; Sadagopan, N. Some algorithmic results on Hamiltonicity and its variants in \(P_6\)-free graphs. (English) Zbl 07608560 J. Anal. 30, No. 4, 1671-1686 (2022). Reviewer: Ali Shakiba (Rafsanǧān) MSC: 68R10 05C38 05C45 05C75 05C85 68Q25 PDF BibTeX XML Cite \textit{R. M. Kumar} and \textit{N. Sadagopan}, J. Anal. 30, No. 4, 1671--1686 (2022; Zbl 07608560) Full Text: DOI OpenURL
Donkers, Huib; Jansen, Bart M. P.; Włodarczyk, Michał Preprocessing for outerplanar vertex deletion: an elementary kernel of quartic size. (English) Zbl 07608295 Algorithmica 84, No. 11, 3407-3458 (2022). MSC: 68Wxx 05Cxx 05C10 68R10 PDF BibTeX XML Cite \textit{H. Donkers} et al., Algorithmica 84, No. 11, 3407--3458 (2022; Zbl 07608295) Full Text: DOI arXiv OpenURL
Dondi, Riccardo; Hosseinzadeh, Mohammad Mehdi Finding colorful paths in temporal graphs. (English) Zbl 07607301 Benito, Rosa Maria (ed.) et al., Complex networks & their applications X. Volume 1. Proceedings of the 10th international conference, COMPLEX NETWORKS 2021, Madrid, Spain, November 30 – December 2, 2021. Cham: Springer. Stud. Comput. Intell. 1015, 553-565 (2022). MSC: 05C85 05C38 05C15 68Q25 68R10 PDF BibTeX XML Cite \textit{R. Dondi} and \textit{M. M. Hosseinzadeh}, Stud. Comput. Intell. 1015, 553--565 (2022; Zbl 07607301) Full Text: DOI arXiv OpenURL
Sadler, Sophie; Greene, Derek; Archambault, Daniel Selecting informative features for post-hoc community explanation. (English) Zbl 07607280 Benito, Rosa Maria (ed.) et al., Complex networks & their applications X. Volume 1. Proceedings of the 10th international conference, COMPLEX NETWORKS 2021, Madrid, Spain, November 30 – December 2, 2021. Cham: Springer. Stud. Comput. Intell. 1015, 297-308 (2022). MSC: 91D30 05C82 68W20 68T05 PDF BibTeX XML Cite \textit{S. Sadler} et al., Stud. Comput. Intell. 1015, 297--308 (2022; Zbl 07607280) Full Text: DOI OpenURL
Gromov, Dmitry; Evmenova, Elizaveta On the exponential ranking and its linear counterpart. (English) Zbl 07607277 Benito, Rosa Maria (ed.) et al., Complex networks & their applications X. Volume 1. Proceedings of the 10th international conference, COMPLEX NETWORKS 2021, Madrid, Spain, November 30 – December 2, 2021. Cham: Springer. Stud. Comput. Intell. 1015, 260-270 (2022). MSC: 05C22 05C82 68W05 PDF BibTeX XML Cite \textit{D. Gromov} and \textit{E. Evmenova}, Stud. Comput. Intell. 1015, 260--270 (2022; Zbl 07607277) Full Text: DOI OpenURL
Naderi, Mohammad Javad; Buchanan, Austin; Walteros, Jose L. Worst-case analysis of clique MIPs. (English) Zbl 07606024 Math. Program. 195, No. 1-2 (A), 517-551 (2022). MSC: 90C27 90C10 90C57 90C35 68Q25 68Q27 68R10 PDF BibTeX XML Cite \textit{M. J. Naderi} et al., Math. Program. 195, No. 1--2 (A), 517--551 (2022; Zbl 07606024) Full Text: DOI OpenURL
Bu, Alan; Choi, Yunseo; Xu, Max An exact bound on the number of chips of parallel chip-firing games that stabilize. (English) Zbl 1500.05042 Arch. Math. 119, No. 5, 471-478 (2022). MSC: 05C57 05C85 68R10 37B15 68Q25 68W05 91A43 PDF BibTeX XML Cite \textit{A. Bu} et al., Arch. Math. 119, No. 5, 471--478 (2022; Zbl 1500.05042) Full Text: DOI OpenURL
Yao, Yan; He, Mengya; Ji, Shengjin On the general position number of two classes of graphs. (English) Zbl 1496.05044 Open Math. 20, 1021-1029 (2022). MSC: 05C12 05C69 68Q25 PDF BibTeX XML Cite \textit{Y. Yao} et al., Open Math. 20, 1021--1029 (2022; Zbl 1496.05044) Full Text: DOI OpenURL
Biswas, Arindam; Jayapaul, Varunkumar; Raman, Venkatesh; Satti, Srinivasa Rao Finding kings in tournaments. (English) Zbl 1498.05111 Discrete Appl. Math. 322, 240-252 (2022). MSC: 05C20 05C69 05C85 68W40 68P10 PDF BibTeX XML Cite \textit{A. Biswas} et al., Discrete Appl. Math. 322, 240--252 (2022; Zbl 1498.05111) Full Text: DOI OpenURL
Zhu, Enqiang; Wu, Pu; Shao, Zehui Exact algorithms for counting 3-colorings of graphs. (English) Zbl 1498.05262 Discrete Appl. Math. 322, 74-93 (2022). MSC: 05C85 05C30 05C15 90C39 68Q17 PDF BibTeX XML Cite \textit{E. Zhu} et al., Discrete Appl. Math. 322, 74--93 (2022; Zbl 1498.05262) Full Text: DOI OpenURL
Araki, Tetsuya; Nakano, Shin-ichi Max-min dispersion on a line. (English) Zbl 1502.90104 J. Comb. Optim. 44, No. 3, 1824-1830 (2022). MSC: 90B80 68R10 90C35 68U05 68W25 PDF BibTeX XML Cite \textit{T. Araki} and \textit{S.-i. Nakano}, J. Comb. Optim. 44, No. 3, 1824--1830 (2022; Zbl 1502.90104) Full Text: DOI OpenURL
Lichen, Junran; Li, Jianping; Lih, Ko-Wei; Yu, Xingxing Approximation algorithms for constructing required subgraphs using stock pieces of fixed length. (English) Zbl 1502.90151 J. Comb. Optim. 44, No. 3, 1774-1795 (2022). MSC: 90C27 90C35 90C59 PDF BibTeX XML Cite \textit{J. Lichen} et al., J. Comb. Optim. 44, No. 3, 1774--1795 (2022; Zbl 1502.90151) Full Text: DOI OpenURL
Bayen, Alexandre; Goodman, Jesse; Vinitsky, Eugene On the approximability of time disjoint walks. (English) Zbl 1502.90141 J. Comb. Optim. 44, No. 3, 1615-1636 (2022). MSC: 90C27 90C35 90C59 PDF BibTeX XML Cite \textit{A. Bayen} et al., J. Comb. Optim. 44, No. 3, 1615--1636 (2022; Zbl 1502.90141) Full Text: DOI OpenURL
Brinkmann, Gunnar A practical algorithm for the computation of the genus. (English) Zbl 07594476 Ars Math. Contemp. 22, No. 4, Paper No. 1, 14 p. (2022). Reviewer: Vladimír Lacko (Košice) MSC: 05C85 05C10 PDF BibTeX XML Cite \textit{G. Brinkmann}, Ars Math. Contemp. 22, No. 4, Paper No. 1, 14 p. (2022; Zbl 07594476) Full Text: DOI arXiv OpenURL
Lonc, Zbigniew; Petryshyn, Nataliya Edge decompositions and rooted packings of graphs. (English) Zbl 07592390 Discrete Math. 345, No. 12, Article ID 113057, 18 p. (2022). Reviewer: Zan-Bo Zhang (Guangzhou) MSC: 05C70 05C75 68Q25 PDF BibTeX XML Cite \textit{Z. Lonc} and \textit{N. Petryshyn}, Discrete Math. 345, No. 12, Article ID 113057, 18 p. (2022; Zbl 07592390) Full Text: DOI OpenURL
Campêlo, Manoel; Matias, Jhonata A. S. Correction to: “Using the minimum maximum flow degree to approximate the flow coloring problem”. (English) Zbl 1499.05593 Ann. Oper. Res. 316, No. 2, 1573-1574 (2022). MSC: 05C85 05C15 05C82 05C21 68Q25 68W25 PDF BibTeX XML Cite \textit{M. Campêlo} and \textit{J. A. S. Matias}, Ann. Oper. Res. 316, No. 2, 1573--1574 (2022; Zbl 1499.05593) Full Text: DOI OpenURL
Campêlo, Manoel; Matias, Jhonata A. S. Using the minimum maximum flow degree to approximate the flow coloring problem. (English) Zbl 1497.05247 Ann. Oper. Res. 316, No. 2, 1267-1278 (2022); correction ibid. 316, No. 2, 1573-1574 (2022). MSC: 05C85 05C15 05C82 05C21 68Q25 68W25 PDF BibTeX XML Cite \textit{M. Campêlo} and \textit{J. A. S. Matias}, Ann. Oper. Res. 316, No. 2, 1267--1278 (2022; Zbl 1497.05247) Full Text: DOI OpenURL
Lima, Carlos V. G. C.; Rautenbach, Dieter; Souza, Uéverton S.; Szwarcfiter, Jayme L. On the computational complexity of the bipartizing matching problem. (English) Zbl 1497.05093 Ann. Oper. Res. 316, No. 2, 1235-1256 (2022). MSC: 05C15 05C10 68Q25 68Q17 05C75 05C70 90C39 PDF BibTeX XML Cite \textit{C. V. G. C. Lima} et al., Ann. Oper. Res. 316, No. 2, 1235--1256 (2022; Zbl 1497.05093) Full Text: DOI arXiv OpenURL
Bonamy, Marthe; Kelly, Tom; Nelson, Peter; Postle, Luke Bounding \(\chi\) by a fraction of \(\Delta\) for graphs without large cliques. (English) Zbl 1497.05068 J. Comb. Theory, Ser. B 157, 263-282 (2022). MSC: 05C15 05C85 05D40 60C05 PDF BibTeX XML Cite \textit{M. Bonamy} et al., J. Comb. Theory, Ser. B 157, 263--282 (2022; Zbl 1497.05068) Full Text: DOI arXiv OpenURL
Dȩbsk, Michał; Piecyk, Marta; Rzążewski, Paweł Faster 3-coloring of small-diameter graphs. (English) Zbl 1497.05075 SIAM J. Discrete Math. 36, No. 3, 2205-2224 (2022). MSC: 05C15 05C12 05C85 68R10 PDF BibTeX XML Cite \textit{M. Dȩbsk} et al., SIAM J. Discrete Math. 36, No. 3, 2205--2224 (2022; Zbl 1497.05075) Full Text: DOI arXiv OpenURL
Rajendra, R.; Bhargava, K.; Shubhalakshmi, D.; Reddy, P. Siva Kota Peripheral Harary index of graphs. (English) Zbl 1495.05057 Palest. J. Math. 11, No. 3, 323-336 (2022). MSC: 05C09 05C12 05C50 05C85 PDF BibTeX XML Cite \textit{R. Rajendra} et al., Palest. J. Math. 11, No. 3, 323--336 (2022; Zbl 1495.05057) Full Text: Link OpenURL
Mathew, Jasmine; Kumar, K. Reji Non-planarity using cycles. (English) Zbl 1495.05008 Palest. J. Math. 11, No. 2, 575-581 (2022). MSC: 05A05 05C10 05C38 05C62 05C85 90B10 68R10 68W05 PDF BibTeX XML Cite \textit{J. Mathew} and \textit{K. R. Kumar}, Palest. J. Math. 11, No. 2, 575--581 (2022; Zbl 1495.05008) Full Text: Link OpenURL
Finbow, Arthur S.; Hartnell, Bert L.; Plummer, Michael D. A characterization of well-indumatchable graphs having girth greater than seven. (English) Zbl 1497.05216 Discrete Appl. Math. 321, 261-271 (2022). MSC: 05C70 05C12 68Q17 68Q25 PDF BibTeX XML Cite \textit{A. S. Finbow} et al., Discrete Appl. Math. 321, 261--271 (2022; Zbl 1497.05216) Full Text: DOI OpenURL
Escamocher, Guillaume; O’Sullivan, Barry Regular pattern-free coloring. (English) Zbl 1497.05081 Discrete Appl. Math. 321, 109-125 (2022). MSC: 05C15 68Q17 68Q25 PDF BibTeX XML Cite \textit{G. Escamocher} and \textit{B. O'Sullivan}, Discrete Appl. Math. 321, 109--125 (2022; Zbl 1497.05081) Full Text: DOI OpenURL
Bagan, Guillaume; Beggas, Fairouz; Haddad, Mohammed; Kheddouci, Hamamache Complexity of edge monitoring on some graph classes. (English) Zbl 1497.05232 Discrete Appl. Math. 321, 49-63 (2022). MSC: 05C75 05C69 05C85 05C22 68Q25 68Q17 PDF BibTeX XML Cite \textit{G. Bagan} et al., Discrete Appl. Math. 321, 49--63 (2022; Zbl 1497.05232) Full Text: DOI arXiv OpenURL
Herrman, Rebekah; Smith, Stephen G. Z. On the length of L-Grundy sequences. (English) Zbl 07585194 Discrete Optim. 45, Article ID 100725, 8 p. (2022). MSC: 05C69 05C50 05C85 PDF BibTeX XML Cite \textit{R. Herrman} and \textit{S. G. Z. Smith}, Discrete Optim. 45, Article ID 100725, 8 p. (2022; Zbl 07585194) Full Text: DOI arXiv OpenURL
Koutecký, Martin A note on coloring \((4K_1, C_4, C_6)\)-free graphs with a \(C_7\). (English) Zbl 1497.05090 Graphs Comb. 38, No. 5, Paper No. 149, 7 p. (2022). MSC: 05C15 05C85 90C10 PDF BibTeX XML Cite \textit{M. Koutecký}, Graphs Comb. 38, No. 5, Paper No. 149, 7 p. (2022; Zbl 1497.05090) Full Text: DOI arXiv OpenURL
Gürsoy, Arif; Gürsoy, Necla Kircali; Ülker, Alper Computing forgotten topological index of zero-divisor graphs of commutative rings. (English) Zbl 1494.05053 Turk. J. Math. 46, No. 5, SI-2, 1845-1863 (2022). MSC: 05C25 05C09 13A70 05C85 PDF BibTeX XML Cite \textit{A. Gürsoy} et al., Turk. J. Math. 46, No. 5, 1845--1863 (2022; Zbl 1494.05053) Full Text: DOI OpenURL
Hua, Yifan; Miller, Kevin; Bertozzi, Andrea L.; Qian, Chen; Wang, Bao Efficient and reliable overlay networks for decentralized federated learning. (English) Zbl 07582042 SIAM J. Appl. Math. 82, No. 4, 1558-1586 (2022). MSC: 65B99 68T01 68T09 68W15 PDF BibTeX XML Cite \textit{Y. Hua} et al., SIAM J. Appl. Math. 82, No. 4, 1558--1586 (2022; Zbl 07582042) Full Text: DOI arXiv OpenURL
Banerjee, Sayan; Bhamidi, Shankar Root finding algorithms and persistence of Jordan centrality in growing random trees. (English) Zbl 1503.05107 Ann. Appl. Probab. 32, No. 3, 2180-2210 (2022). Reviewer: Jean-Jil Duchamps (Besançon) MSC: 05C80 05C85 60J80 60J85 PDF BibTeX XML Cite \textit{S. Banerjee} and \textit{S. Bhamidi}, Ann. Appl. Probab. 32, No. 3, 2180--2210 (2022; Zbl 1503.05107) Full Text: DOI arXiv OpenURL
Bhat, K. Arathi; Sudhakara, G.; Vinay, M. Algorithm to check the existence of \(H\) for a given \(G\) such that \(A(G)A(H)\) is graphical. (English) Zbl 1493.05281 Discrete Math. Algorithms Appl. 14, No. 5, Article ID 2150159, 15 p. (2022). MSC: 05C85 05C50 PDF BibTeX XML Cite \textit{K. A. Bhat} et al., Discrete Math. Algorithms Appl. 14, No. 5, Article ID 2150159, 15 p. (2022; Zbl 1493.05281) Full Text: DOI OpenURL
Hajebi, Sepehr; Li, Yanjia; Spirkl, Sophie Complexity dichotomy for list-5-coloring with a forbidden induced subgraph. (English) Zbl 1496.05051 SIAM J. Discrete Math. 36, No. 3, 2004-2027 (2022). MSC: 05C15 68Q25 PDF BibTeX XML Cite \textit{S. Hajebi} et al., SIAM J. Discrete Math. 36, No. 3, 2004--2027 (2022; Zbl 1496.05051) Full Text: DOI arXiv OpenURL
Suijlen, Wijnand; de Framond, Félix; Lallouet, Arnaud; Petitet, Antoine A parallel algorithm for GAC filtering of the Alldifferent constraint. (English) Zbl 1502.68281 Schaus, Pierre (ed.), Integration of constraint programming, artificial intelligence, and operations research. 19th international conference, CPAIOR 2022, Los Angeles, CA, USA, June 20–23, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13292, 390-407 (2022). MSC: 68T20 68W10 90C35 90C59 PDF BibTeX XML Cite \textit{W. Suijlen} et al., Lect. Notes Comput. Sci. 13292, 390--407 (2022; Zbl 1502.68281) Full Text: DOI OpenURL
Steinerberger, Stefan; Wu, Hau-tieng Eigenvector phase retrieval: recovering eigenvectors from the absolute value of their entries. (English) Zbl 1496.05100 Linear Algebra Appl. 652, 239-252 (2022). MSC: 05C50 65F10 94A12 68W20 PDF BibTeX XML Cite \textit{S. Steinerberger} and \textit{H.-t. Wu}, Linear Algebra Appl. 652, 239--252 (2022; Zbl 1496.05100) Full Text: DOI arXiv OpenURL
de Figueiredo, C. M. H.; Patrão, C. S. R.; Sasaki, D.; Valencia-Pabon, M. On total and edge coloring some Kneser graphs. (English) Zbl 1498.05095 J. Comb. Optim. 44, No. 1, 119-135 (2022). MSC: 05C15 05C85 05C69 05C76 PDF BibTeX XML Cite \textit{C. M. H. de Figueiredo} et al., J. Comb. Optim. 44, No. 1, 119--135 (2022; Zbl 1498.05095) Full Text: DOI OpenURL
Raman, Rajiv; Ray, Saurabh On the geometric set multicover problem. (English) Zbl 07575553 Discrete Comput. Geom. 68, No. 2, 566-591 (2022). MSC: 68W25 52C15 05C10 PDF BibTeX XML Cite \textit{R. Raman} and \textit{S. Ray}, Discrete Comput. Geom. 68, No. 2, 566--591 (2022; Zbl 07575553) Full Text: DOI OpenURL
Safe, Martín D. Essential obstacles to Helly circular-arc graphs. (English) Zbl 07574719 Discrete Appl. Math. 320, 245-258 (2022). Reviewer: Brahadeesh Sankarnarayanan (Mumbai) MSC: 05C62 05C75 05C85 PDF BibTeX XML Cite \textit{M. D. Safe}, Discrete Appl. Math. 320, 245--258 (2022; Zbl 07574719) Full Text: DOI arXiv OpenURL
Hörsch, Florian; Szigeti, Zoltán Reachability in arborescence packings. (English) Zbl 1503.05096 Discrete Appl. Math. 320, 170-183 (2022). Reviewer: Sizhong Zhou (Zhenjiang) MSC: 05C70 05C20 05C65 05B35 05C85 52B40 PDF BibTeX XML Cite \textit{F. Hörsch} and \textit{Z. Szigeti}, Discrete Appl. Math. 320, 170--183 (2022; Zbl 1503.05096) Full Text: DOI arXiv OpenURL