Schiff, Krzysztof An ant algorithm for the maximum number of 3-cliques in 3-partite graphs. (English) Zbl 1486.05149 Control Cybern. 50, No. 2, 347-358 (2021). MSC: 05C30 05C35 05C70 90C35 90C27 PDFBibTeX XMLCite \textit{K. Schiff}, Control Cybern. 50, No. 2, 347--358 (2021; Zbl 1486.05149)
Rohatgi, Dhruv; Urschel, John C.; Wellens, Jake Regarding two conjectures on clique and biclique partitions. (English) Zbl 1486.05250 Electron. J. Comb. 28, No. 4, Research Paper P4.53, 18 p. (2021). MSC: 05C70 05C35 05C69 PDFBibTeX XMLCite \textit{D. Rohatgi} et al., Electron. J. Comb. 28, No. 4, Research Paper P4.53, 18 p. (2021; Zbl 1486.05250) Full Text: DOI arXiv
Liang, Xiaoye; Tan, Ying-Ying; Koolen, Jack Thin distance-regular graphs with classical parameters \((D, q, q, \frac{q^t-1}{q-1}-1)\) with \(t> D\) are the Grassmann graphs. (English) Zbl 1486.05180 Electron. J. Comb. 28, No. 4, Research Paper P4.45, 21 p. (2021). MSC: 05C50 05C12 05C75 05E30 PDFBibTeX XMLCite \textit{X. Liang} et al., Electron. J. Comb. 28, No. 4, Research Paper P4.45, 21 p. (2021; Zbl 1486.05180) Full Text: DOI
Gurski, Frank; Komander, Dominique; Rehs, Carolin Acyclic coloring parameterized by directed clique-width. (English) Zbl 07497524 Mudgal, Apurva (ed.) et al., Algorithms and discrete applied mathematics. 7th international conference, CALDAM 2021, Rupnagar, India, February 11–13, 2021. Proceedings. Lect. Notes Comput. Sci. 12601, 95-108 (2021). MSC: 68Wxx PDFBibTeX XMLCite \textit{F. Gurski} et al., Lect. Notes Comput. Sci. 12601, 95--108 (2021; Zbl 07497524) Full Text: DOI
Censor-Hillel, Keren; Maus, Yannic; Polosukhin, Volodymyr Near-optimal scheduling in the congested clique. (English) Zbl 07495133 Jurdziński, Tomasz (ed.) et al., Structural information and communication complexity. 28th international colloquium, SIROCCO 2021, Wrocław, Poland, June 28 – July 1, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12810, 50-67 (2021). MSC: 68Mxx 68Q11 68R10 PDFBibTeX XMLCite \textit{K. Censor-Hillel} et al., Lect. Notes Comput. Sci. 12810, 50--67 (2021; Zbl 07495133) Full Text: DOI arXiv
Pang, Shuo Large clique is hard on average for resolution. (English) Zbl 07493542 Santhanam, Rahul (ed.) et al., Computer science – theory and applications. 16th international computer science symposium in Russia, CSR 2021, Sochi, Russia, June 28 – July 2, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12730, 361-380 (2021). MSC: 68Qxx PDFBibTeX XMLCite \textit{S. Pang}, Lect. Notes Comput. Sci. 12730, 361--380 (2021; Zbl 07493542) Full Text: DOI
Assari, A.; Rahimi, M. On Beck’s coloring for measurable functions. (English) Zbl 1485.05046 Iran. J. Math. Sci. Inform. 16, No. 2, 1-10 (2021). MSC: 05C15 05C69 46E30 PDFBibTeX XMLCite \textit{A. Assari} and \textit{M. Rahimi}, Iran. J. Math. Sci. Inform. 16, No. 2, 1--10 (2021; Zbl 1485.05046) Full Text: Link
Luiz, Thiago Alcântara; Santos, Haroldo Gambini; Uchoa, Eduardo Cover by disjoint cliques cuts for the knapsack problem with conflicting items. (English) Zbl 1525.90367 Oper. Res. Lett. 49, No. 6, 844-850 (2021). MSC: 90C27 90C35 90C10 PDFBibTeX XMLCite \textit{T. A. Luiz} et al., Oper. Res. Lett. 49, No. 6, 844--850 (2021; Zbl 1525.90367) Full Text: DOI
Pranjali; Kumar, Amit; Sharma, Pooja Line graph of unit graphs associated with finite commutative rings. (English) Zbl 1483.13017 Proyecciones 40, No. 4, 919-926 (2021). Reviewer: T. Tamizh Chelvam (Tirunelveli) MSC: 13A70 05C25 05C69 05C15 PDFBibTeX XMLCite \textit{Pranjali} et al., Proyecciones 40, No. 4, 919--926 (2021; Zbl 1483.13017) Full Text: DOI
Park, Soyoung; Carriquiry, Alicia Quantifying the similarity of 2D images using edge pixels: an application to the forensic comparison of footwear impressions. (English) Zbl 1521.62439 J. Appl. Stat. 48, No. 10, 1833-1860 (2021). MSC: 62-XX PDFBibTeX XMLCite \textit{S. Park} and \textit{A. Carriquiry}, J. Appl. Stat. 48, No. 10, 1833--1860 (2021; Zbl 1521.62439) Full Text: DOI Link
Li, Jin-Yue; Li, Xiang; Li, Cong The Kronecker-clique model for higher-order clustering coefficients. (English) Zbl 07482435 Physica A 582, Article ID 126269, 10 p. (2021). MSC: 82-XX PDFBibTeX XMLCite \textit{J.-Y. Li} et al., Physica A 582, Article ID 126269, 10 p. (2021; Zbl 07482435) Full Text: DOI
Nikmehr, M. J.; Azadi, A. Perfect nilpotent graphs. (English) Zbl 1499.05247 Kragujevac J. Math. 45, No. 4, 521-529 (2021). MSC: 05C17 05C15 05C25 PDFBibTeX XMLCite \textit{M. J. Nikmehr} and \textit{A. Azadi}, Kragujevac J. Math. 45, No. 4, 521--529 (2021; Zbl 1499.05247) Full Text: DOI Link
Alwan, Ahmed H. Maximal submodule graph of a module. (English) Zbl 1483.05075 J. Discrete Math. Sci. Cryptography 24, No. 7, 1941-1949 (2021). MSC: 05C25 05C15 05C69 05C40 05C10 16D10 PDFBibTeX XMLCite \textit{A. H. Alwan}, J. Discrete Math. Sci. Cryptography 24, No. 7, 1941--1949 (2021; Zbl 1483.05075) Full Text: DOI
Muneshwar, R. A.; Bondar, K. L. Some results on an intersection graph of a topology. (English) Zbl 1491.05067 J. Discrete Math. Sci. Cryptography 24, No. 4, 1053-1062 (2021). Reviewer: Josef Lauri (Msida) MSC: 05C10 05C69 05C07 05C12 PDFBibTeX XMLCite \textit{R. A. Muneshwar} and \textit{K. L. Bondar}, J. Discrete Math. Sci. Cryptography 24, No. 4, 1053--1062 (2021; Zbl 1491.05067) Full Text: DOI
Orhan Ertaş, Nil; Sürül, Sema Some properties of intersection graph of a module with an application of the graph of \(\mathbb{Z}_n\). (English) Zbl 1483.05079 J. Discrete Math. Sci. Cryptography 24, No. 4, 899-916 (2021). MSC: 05C25 16D10 05C15 05C69 05E40 13A70 PDFBibTeX XMLCite \textit{N. Orhan Ertaş} and \textit{S. Sürül}, J. Discrete Math. Sci. Cryptography 24, No. 4, 899--916 (2021; Zbl 1483.05079) Full Text: DOI
Mitsche, Dieter; Penrose, Mathew D. Limit theory of combinatorial optimization for random geometric graphs. (English) Zbl 1482.05313 Ann. Appl. Probab. 31, No. 6, 2721-2771 (2021). MSC: 05C80 60D05 60F15 90C27 90C35 60G55 PDFBibTeX XMLCite \textit{D. Mitsche} and \textit{M. D. Penrose}, Ann. Appl. Probab. 31, No. 6, 2721--2771 (2021; Zbl 1482.05313) Full Text: DOI arXiv
Gauci, John Baptist; Zerafa, Jean Paul The Erdős-Faber-Lovász conjecture revisited. (English) Zbl 1482.05105 Note Mat. 41, No. 2, 1-8 (2021). MSC: 05C15 PDFBibTeX XMLCite \textit{J. B. Gauci} and \textit{J. P. Zerafa}, Note Mat. 41, No. 2, 1--8 (2021; Zbl 1482.05105) Full Text: DOI arXiv
Szabó, Sándor A clique search problem and its application to machine scheduling. (English) Zbl 1483.90145 SN Oper. Res. Forum 2, No. 4, Paper No. 69, 12 p. (2021). MSC: 90C27 90C35 90B35 05C69 05C15 PDFBibTeX XMLCite \textit{S. Szabó}, SN Oper. Res. Forum 2, No. 4, Paper No. 69, 12 p. (2021; Zbl 1483.90145) Full Text: DOI
Visweswaran, S.; Lalchandani, Premkumar T. The exact zero-divisor graph of a reduced ring. (English) Zbl 1483.13018 Indian J. Pure Appl. Math. 52, No. 4, 1123-1144 (2021). Reviewer: Qiao Lei (Chengdu) MSC: 13A70 13A15 05C25 PDFBibTeX XMLCite \textit{S. Visweswaran} and \textit{P. T. Lalchandani}, Indian J. Pure Appl. Math. 52, No. 4, 1123--1144 (2021; Zbl 1483.13018) Full Text: DOI
Fox, Jacob; Pach, János; Suk, Andrew Bounded \(VC\)-dimension implies the Schur-Erdős conjecture. (English) Zbl 1499.05606 Combinatorica 41, No. 6, 803-813 (2021). Reviewer: Ko-Wei Lih (Taipei) MSC: 05D10 05C55 PDFBibTeX XMLCite \textit{J. Fox} et al., Combinatorica 41, No. 6, 803--813 (2021; Zbl 1499.05606) Full Text: DOI arXiv
Censor-Hillel, Keren; Dory, Michal; Korhonen, Janne H.; Leitersdorf, Dean Fast approximate shortest paths in the congested clique. (English) Zbl 1522.68387 Distrib. Comput. 34, No. 6, 463-487 (2021). MSC: 68R10 68W15 68W25 PDFBibTeX XMLCite \textit{K. Censor-Hillel} et al., Distrib. Comput. 34, No. 6, 463--487 (2021; Zbl 1522.68387) Full Text: DOI
Nikoletseas, Sotiris E.; Raptopoulos, Christoforos L.; Spirakis, Paul G. Maximum cliques in graphs with small intersection number and random intersection graphs. (English) Zbl 1487.05198 Comput. Sci. Rev. 39, Article ID 100353, 10 p. (2021). MSC: 05C69 05C80 05C35 05C70 68R10 PDFBibTeX XMLCite \textit{S. E. Nikoletseas} et al., Comput. Sci. Rev. 39, Article ID 100353, 10 p. (2021; Zbl 1487.05198) Full Text: DOI arXiv
Johnson, Peter; Krumpelman, Alexis On the Babai and upper chromatic numbers of graphs of diameter 2. (English) Zbl 1476.05054 Tamkang J. Math. 52, No. 1, 113-123 (2021). MSC: 05C15 05C12 PDFBibTeX XMLCite \textit{P. Johnson} and \textit{A. Krumpelman}, Tamkang J. Math. 52, No. 1, 113--123 (2021; Zbl 1476.05054) Full Text: DOI
Tang, Zhong-Zheng; Diao, Zhuo Approximation algorithms on \(k\)-cycle transversal and \(k\)-clique transversal. (English) Zbl 1488.05472 J. Oper. Res. Soc. China 9, No. 4, 883-892 (2021). MSC: 05C85 68W25 05D15 05C22 PDFBibTeX XMLCite \textit{Z.-Z. Tang} and \textit{Z. Diao}, J. Oper. Res. Soc. China 9, No. 4, 883--892 (2021; Zbl 1488.05472) Full Text: DOI
Ahmed, Tarek Sayed Blow up and blur constructions in algebraic logic. (English) Zbl 07442319 Madarász, Judit (ed.) et al., Hajnal Andréka and István Németi on unity of science. From computing to relativity theory through algebraic logic. Cham: Springer. Outst. Contrib. Log. 19, 347-359 (2021). MSC: 03-XX 68-XX PDFBibTeX XMLCite \textit{T. S. Ahmed}, Outst. Contrib. Log. 19, 347--359 (2021; Zbl 07442319) Full Text: DOI arXiv
Alves, Caio; Ribeiro, Rodrigo; Sanchis, Rémy Clustering in preferential attachment random graphs with edge-step. (English) Zbl 1479.05321 J. Appl. Probab. 58, No. 4, 890-908 (2021). MSC: 05C80 05C82 05C10 60C05 60K40 68R10 PDFBibTeX XMLCite \textit{C. Alves} et al., J. Appl. Probab. 58, No. 4, 890--908 (2021; Zbl 1479.05321) Full Text: DOI
Dallard, Clément; Milanič, Martin; Štorgel, Kenny Treewidth versus clique number. I: Graph classes with a forbidden structure. (English) Zbl 1479.05308 SIAM J. Discrete Math. 35, No. 4, 2618-2646 (2021). MSC: 05C75 05C05 05C69 05C83 05C40 05C85 68P05 PDFBibTeX XMLCite \textit{C. Dallard} et al., SIAM J. Discrete Math. 35, No. 4, 2618--2646 (2021; Zbl 1479.05308) Full Text: DOI arXiv
Betre, Kassahun; Salinger, Evatt The inductive graph dimension from the minimum edge clique cover. (English) Zbl 1479.05310 Graphs Comb. 37, No. 6, 2637-2654 (2021). MSC: 05C76 05C69 PDFBibTeX XMLCite \textit{K. Betre} and \textit{E. Salinger}, Graphs Comb. 37, No. 6, 2637--2654 (2021; Zbl 1479.05310) Full Text: DOI arXiv
Dębski, Michał; Śleszyńska-Nowak, Małgorzata Strong cliques in claw-free graphs. (English) Zbl 1479.05258 Graphs Comb. 37, No. 6, 2581-2593 (2021). MSC: 05C69 05C15 PDFBibTeX XMLCite \textit{M. Dębski} and \textit{M. Śleszyńska-Nowak}, Graphs Comb. 37, No. 6, 2581--2593 (2021; Zbl 1479.05258) Full Text: DOI
Guo, Jun Erdős-Ko-Rado theorem for matrices over residue class rings. (English) Zbl 1479.05344 Graphs Comb. 37, No. 6, 2497-2510 (2021). MSC: 05D05 05C50 05C69 05C15 15B33 PDFBibTeX XMLCite \textit{J. Guo}, Graphs Comb. 37, No. 6, 2497--2510 (2021; Zbl 1479.05344) Full Text: DOI
Safi, Mohammadreza; Nabavi, Seyed Saeed; Caron, Richard J. A modified simplex partition algorithm to test copositivity. (English) Zbl 1484.65128 J. Glob. Optim. 81, No. 3, 645-658 (2021). MSC: 65K05 65F99 90C22 90C99 PDFBibTeX XMLCite \textit{M. Safi} et al., J. Glob. Optim. 81, No. 3, 645--658 (2021; Zbl 1484.65128) Full Text: DOI
Becker, Florent; Montealegre, Pedro; Rapaport, Ivan; Todinca, Ioan The role of randomness in the broadcast congested clique model. (English) Zbl 1518.68126 Inf. Comput. 281, Article ID 104669, 13 p. (2021). MSC: 68Q10 68M12 68W15 68W40 PDFBibTeX XMLCite \textit{F. Becker} et al., Inf. Comput. 281, Article ID 104669, 13 p. (2021; Zbl 1518.68126) Full Text: DOI
Sinnl, Markus A note on computational approaches for the antibandwidth problem. (English) Zbl 07432793 CEJOR, Cent. Eur. J. Oper. Res. 29, No. 3, 1057-1077 (2021). MSC: 90Bxx PDFBibTeX XMLCite \textit{M. Sinnl}, CEJOR, Cent. Eur. J. Oper. Res. 29, No. 3, 1057--1077 (2021; Zbl 07432793) Full Text: DOI arXiv
Francis, Mathew; Neogi, Rian; Raman, Venkatesh Recognizing \(k\)-clique extendible orderings. (English) Zbl 1522.68402 Algorithmica 83, No. 11, 3338-3362 (2021). MSC: 68R10 05C69 68Q17 68Q25 68Q27 PDFBibTeX XMLCite \textit{M. Francis} et al., Algorithmica 83, No. 11, 3338--3362 (2021; Zbl 1522.68402) Full Text: DOI arXiv
Chaplick, Steven; Töpfer, Martin; Voborník, Jan; Zeman, Peter On \(H\)-topological intersection graphs. (English) Zbl 1518.05179 Algorithmica 83, No. 11, 3281-3318 (2021). MSC: 05C85 05C62 68Q25 68Q27 PDFBibTeX XMLCite \textit{S. Chaplick} et al., Algorithmica 83, No. 11, 3281--3318 (2021; Zbl 1518.05179) Full Text: DOI
Czumaj, Artur; Davies, Peter; Parter, Merav Simple, deterministic, constant-round coloring in congested clique and MPC. (English) Zbl 07430750 SIAM J. Comput. 50, No. 5, 1603-1626 (2021). MSC: 68R10 05C15 05C85 68W10 68W15 68W20 PDFBibTeX XMLCite \textit{A. Czumaj} et al., SIAM J. Comput. 50, No. 5, 1603--1626 (2021; Zbl 07430750) Full Text: DOI
Toker, Kemal Zero-divisor graphs of Catalan monoid. (English) Zbl 1499.05297 Hacet. J. Math. Stat. 50, No. 2, 387-396 (2021). MSC: 05C25 20M20 20M14 PDFBibTeX XMLCite \textit{K. Toker}, Hacet. J. Math. Stat. 50, No. 2, 387--396 (2021; Zbl 1499.05297) Full Text: DOI
Kitamura, Naoki; Kitagawa, Hirotaka; Otachi, Yota; Izumi, Taisuke Low-congestion shortcut and graph parameters. (English) Zbl 1522.68410 Distrib. Comput. 34, No. 5, 349-365 (2021). MSC: 68R10 68W15 PDFBibTeX XMLCite \textit{N. Kitamura} et al., Distrib. Comput. 34, No. 5, 349--365 (2021; Zbl 1522.68410) Full Text: DOI arXiv
Guo, Xiao-bing; Peng, Yue-jian Connection between continuous optimization and Turán densities of non-uniform hypergraphs. (English) Zbl 1477.05130 Acta Math. Appl. Sin., Engl. Ser. 37, No. 4, 858-866 (2021). MSC: 05C65 05C30 05C35 90C35 PDFBibTeX XMLCite \textit{X.-b. Guo} and \textit{Y.-j. Peng}, Acta Math. Appl. Sin., Engl. Ser. 37, No. 4, 858--866 (2021; Zbl 1477.05130) Full Text: DOI
Kouri, Drew P.; Ridzal, Denis; Tuminaro, Ray KKT preconditioners for PDE-constrained optimization with the Helmholtz equation. (English) Zbl 1518.65130 SIAM J. Sci. Comput. 43, No. 5, S225-S248 (2021). MSC: 65N30 65K10 65F08 65F10 35B30 49N10 49M41 35L05 PDFBibTeX XMLCite \textit{D. P. Kouri} et al., SIAM J. Sci. Comput. 43, No. 5, S225--S248 (2021; Zbl 1518.65130) Full Text: DOI
Bacciu, Davide; Conte, Alessio; Grossi, Roberto; Landolfi, Francesco; Marino, Andrea K-plex cover pooling for graph neural networks. (English) Zbl 1483.68274 Data Min. Knowl. Discov. 35, No. 5, 2200-2220 (2021). MSC: 68T05 05C70 62H30 68R10 PDFBibTeX XMLCite \textit{D. Bacciu} et al., Data Min. Knowl. Discov. 35, No. 5, 2200--2220 (2021; Zbl 1483.68274) Full Text: DOI
Diwan, Ganesh C.; Mohamed, M. Shadi Iterative solution with shifted Laplace preconditioner for plane wave enriched isogeometric analysis and finite element discretization for high-frequency acoustics. (English) Zbl 1507.74534 Comput. Methods Appl. Mech. Eng. 384, Article ID 114006, 19 p. (2021). MSC: 74S22 65M60 PDFBibTeX XMLCite \textit{G. C. Diwan} and \textit{M. S. Mohamed}, Comput. Methods Appl. Mech. Eng. 384, Article ID 114006, 19 p. (2021; Zbl 1507.74534) Full Text: DOI
Szabó, Sándor Estimating the fractional chromatic number of a graph. (English) Zbl 1512.05148 Acta Univ. Sapientiae, Inform. 13, No. 1, 122-133 (2021). MSC: 05C15 90C10 90C05 90C27 PDFBibTeX XMLCite \textit{S. Szabó}, Acta Univ. Sapientiae, Inform. 13, No. 1, 122--133 (2021; Zbl 1512.05148) Full Text: DOI
Gurski, Frank; Komander, Dominique; Lindemann, Marvin Efficient computation of the oriented chromatic number of recursively defined digraphs. (English) Zbl 1514.68218 Theor. Comput. Sci. 890, 16-35 (2021). MSC: 68R10 05C15 05C20 05C85 68Q25 68Q27 PDFBibTeX XMLCite \textit{F. Gurski} et al., Theor. Comput. Sci. 890, 16--35 (2021; Zbl 1514.68218) Full Text: DOI arXiv
Kou, Yongfang; Hu, Xiaomin; Yang, Weihua The clique distribution in powers of hypercubes. (English) Zbl 1486.94168 Discrete Appl. Math. 305, 76-85 (2021). Reviewer: V. Yegnanarayanan (Chennai) MSC: 94B05 94B25 05C12 PDFBibTeX XMLCite \textit{Y. Kou} et al., Discrete Appl. Math. 305, 76--85 (2021; Zbl 1486.94168) Full Text: DOI
Habibi, Mohammad; Yetkın Çelıkel, Ece; Abdıoğlu, Cihat Clean graph of a ring. (English) Zbl 1477.13005 J. Algebra Appl. 20, No. 9, Article ID 2150156, 10 p. (2021). Reviewer: A. Mimouni (Dhahran) MSC: 13A15 05C25 13A70 PDFBibTeX XMLCite \textit{M. Habibi} et al., J. Algebra Appl. 20, No. 9, Article ID 2150156, 10 p. (2021; Zbl 1477.13005) Full Text: DOI
Shimizu, Satoshi; Yamaguchi, Kazuaki; Masuda, Sumio Parallelization of a branch-and-bound algorithm for the maximum weight clique problem. (English) Zbl 1506.90264 Discrete Optim. 41, Article ID 100646, 13 p. (2021). MSC: 90C35 05C85 90C57 PDFBibTeX XMLCite \textit{S. Shimizu} et al., Discrete Optim. 41, Article ID 100646, 13 p. (2021; Zbl 1506.90264) Full Text: DOI
Agrawal, Garima; Maity, Soumen The small set vertex expansion problem. (English) Zbl 1514.68195 Theor. Comput. Sci. 886, 84-93 (2021). MSC: 68R10 68Q27 PDFBibTeX XMLCite \textit{G. Agrawal} and \textit{S. Maity}, Theor. Comput. Sci. 886, 84--93 (2021; Zbl 1514.68195) Full Text: DOI
Fallat, Shaun; Meagher, Karen; Shirazi, Mahsa N. The Erdős-Ko-Rado theorem for 2-intersecting families of perfect matchings. (English) Zbl 1473.05299 Algebr. Comb. 4, No. 4, 575-598 (2021). MSC: 05D05 05C70 05E30 PDFBibTeX XMLCite \textit{S. Fallat} et al., Algebr. Comb. 4, No. 4, 575--598 (2021; Zbl 1473.05299) Full Text: DOI arXiv
Wang, Jinwei; Luo, Yanfeng; Wang, Xiaomeng Quantum multiplicative graph and a type of separate clique number. (English) Zbl 1473.05097 Commun. Algebra 49, No. 8, 3214-3222 (2021). MSC: 05C15 05C60 05C76 05C57 91A43 PDFBibTeX XMLCite \textit{J. Wang} et al., Commun. Algebra 49, No. 8, 3214--3222 (2021; Zbl 1473.05097) Full Text: DOI
Rajkumar, R.; Anitha, T. Some results on the reduced power graph of a group. (English) Zbl 1488.05244 Southeast Asian Bull. Math. 45, No. 2, 241-262 (2021). MSC: 05C25 05C12 05C40 05C69 20D60 PDFBibTeX XMLCite \textit{R. Rajkumar} and \textit{T. Anitha}, Southeast Asian Bull. Math. 45, No. 2, 241--262 (2021; Zbl 1488.05244) Full Text: arXiv
Zhou, Jiang; van Dam, Edwin R. Spectral radius and clique partitions of graphs. (English) Zbl 1473.05195 Linear Algebra Appl. 630, 84-94 (2021). MSC: 05C50 05C70 05B20 PDFBibTeX XMLCite \textit{J. Zhou} and \textit{E. R. van Dam}, Linear Algebra Appl. 630, 84--94 (2021; Zbl 1473.05195) Full Text: DOI arXiv
Garstka, Michael; Cannon, Mark; Goulart, Paul COSMO: a conic operator splitting method for convex conic problems. (English) Zbl 1478.90087 J. Optim. Theory Appl. 190, No. 3, 779-810 (2021). MSC: 90C25 PDFBibTeX XMLCite \textit{M. Garstka} et al., J. Optim. Theory Appl. 190, No. 3, 779--810 (2021; Zbl 1478.90087) Full Text: DOI arXiv
Nikmehr, Mohammad Javad; Azadi, Abdolreza; Nikandish, Reza The weakly zero-divisor graph of a commutative ring. (English) Zbl 1470.13012 Rev. Unión Mat. Argent. 62, No. 1, 105-116 (2021). MSC: 13A70 13A15 05C25 PDFBibTeX XMLCite \textit{M. J. Nikmehr} et al., Rev. Unión Mat. Argent. 62, No. 1, 105--116 (2021; Zbl 1470.13012) Full Text: DOI
Joret, Gwenaël; Micek, Piotr; Reed, Bruce; Smid, Michiel Tight bounds on the clique chromatic number. (English) Zbl 1510.05075 Electron. J. Comb. 28, No. 3, Research Paper P3.51, 8 p. (2021). MSC: 05C15 05D40 PDFBibTeX XMLCite \textit{G. Joret} et al., Electron. J. Comb. 28, No. 3, Research Paper P3.51, 8 p. (2021; Zbl 1510.05075) Full Text: DOI arXiv
García-Marco, Ignacio; Knauer, Kolja; Montejano, Luis Pedro Chomp on generalized Kneser graphs and others. (English) Zbl 1473.05204 Int. J. Game Theory 50, No. 3, 603-621 (2021). MSC: 05C57 91A05 91A46 91A43 PDFBibTeX XMLCite \textit{I. García-Marco} et al., Int. J. Game Theory 50, No. 3, 603--621 (2021; Zbl 1473.05204) Full Text: DOI arXiv
Buchatsky, Sagi; Treister, Eran Full waveform inversion using extended and simultaneous sources. (English) Zbl 1470.35429 SIAM J. Sci. Comput. 43, No. 5, S862-S883 (2021). MSC: 35R30 65N21 86A22 86A15 65M32 65N22 35Q86 PDFBibTeX XMLCite \textit{S. Buchatsky} and \textit{E. Treister}, SIAM J. Sci. Comput. 43, No. 5, S862--S883 (2021; Zbl 1470.35429) Full Text: DOI arXiv
Bercov, Vladimir Connected domination number and a new invariant in graphs with independence number three. (English) Zbl 1470.05122 Comput. Sci. J. Mold. 29, No. 1(85), 96-104 (2021). MSC: 05C69 PDFBibTeX XMLCite \textit{V. Bercov}, Comput. Sci. J. Mold. 29, No. 1(85), 96--104 (2021; Zbl 1470.05122) Full Text: Link
Kelly, Tom; Postle, Luke Corrigendum to: “A local epsilon version of Reed’s conjecture”. (English) Zbl 1472.05052 J. Comb. Theory, Ser. B 151, 509-512 (2021). MSC: 05C15 05C07 05C35 PDFBibTeX XMLCite \textit{T. Kelly} and \textit{L. Postle}, J. Comb. Theory, Ser. B 151, 509--512 (2021; Zbl 1472.05052) Full Text: DOI arXiv
Adlifard, M.; Payrovi, Sh. Some classes of perfect annihilator-ideal graphs associated with commutative rings. (English) Zbl 1488.13002 J. Algebra Relat. Top. 9, No. 1, 21-29 (2021). MSC: 13A15 13B99 05C99 05C25 PDFBibTeX XMLCite \textit{M. Adlifard} and \textit{Sh. Payrovi}, J. Algebra Relat. Top. 9, No. 1, 21--29 (2021; Zbl 1488.13002) Full Text: DOI
Kanwal, Ansa; Aslam, Adnan; Raza, Zahid; Iqbal, Naveed; Kometa, Bawfeh K. On the variable sum exdeg index and cut edges of graphs. (English) Zbl 1488.05105 Commun. Comb. Optim. 6, No. 2, 249-257 (2021). MSC: 05C09 05C05 05C35 05C92 92E10 PDFBibTeX XMLCite \textit{A. Kanwal} et al., Commun. Comb. Optim. 6, No. 2, 249--257 (2021; Zbl 1488.05105) Full Text: DOI
Mohammadi, Neda; Kadivar, Mehdi A local core number based algorithm for the maximum clique problem. (English) Zbl 1488.05389 Trans. Comb. 10, No. 3, 149-163 (2021). MSC: 05C69 05C85 PDFBibTeX XMLCite \textit{N. Mohammadi} and \textit{M. Kadivar}, Trans. Comb. 10, No. 3, 149--163 (2021; Zbl 1488.05389) Full Text: DOI
Xu, Yian A better upper bound on the chromatic number of (cap, even-hole)-free graphs. (English) Zbl 1472.05059 Discrete Math. 344, No. 11, Article ID 112581, 6 p. (2021). MSC: 05C15 05C38 05C12 PDFBibTeX XMLCite \textit{Y. Xu}, Discrete Math. 344, No. 11, Article ID 112581, 6 p. (2021; Zbl 1472.05059) Full Text: DOI
Li, Dan; Qin, Rui The \(A_\alpha\)-spectral radius of graphs with a prescribed number of edges for \(\frac{1}{2}\leq\alpha\leq 1\). (English) Zbl 1510.05191 Linear Algebra Appl. 628, 29-41 (2021). MSC: 05C50 05C12 PDFBibTeX XMLCite \textit{D. Li} and \textit{R. Qin}, Linear Algebra Appl. 628, 29--41 (2021; Zbl 1510.05191) Full Text: DOI
Bergougnoux, Benjamin; Kanté, Mamadou Moustapha More applications of the \(d\)-neighbor equivalence: acyclicity and connectivity constraints. (English) Zbl 1475.05160 SIAM J. Discrete Math. 35, No. 3, 1881-1926 (2021). Reviewer: Marcin Anholcer (Poznań) MSC: 05C85 05C40 68Q27 PDFBibTeX XMLCite \textit{B. Bergougnoux} and \textit{M. M. Kanté}, SIAM J. Discrete Math. 35, No. 3, 1881--1926 (2021; Zbl 1475.05160) Full Text: DOI arXiv
Hong, Won Eui; Pego, Robert L. Exclusion and multiplicity for stable communities in Lotka-Volterra systems. (English) Zbl 1470.92243 J. Math. Biol. 83, No. 2, Paper No. 16, 29 p. (2021). MSC: 92D25 92D40 34D20 91A22 PDFBibTeX XMLCite \textit{W. E. Hong} and \textit{R. L. Pego}, J. Math. Biol. 83, No. 2, Paper No. 16, 29 p. (2021; Zbl 1470.92243) Full Text: DOI arXiv
Suk, Andrew; Tomon, István Hasse diagrams with large chromatic number. (English) Zbl 1470.05062 Bull. Lond. Math. Soc. 53, No. 3, 747-758 (2021). MSC: 05C15 05D10 52C10 PDFBibTeX XMLCite \textit{A. Suk} and \textit{I. Tomon}, Bull. Lond. Math. Soc. 53, No. 3, 747--758 (2021; Zbl 1470.05062) Full Text: DOI arXiv
Davies, James; Mccarty, Rose Circle graphs are quadratically \(\chi \)-bounded. (English) Zbl 1470.05052 Bull. Lond. Math. Soc. 53, No. 3, 673-679 (2021). MSC: 05C15 05C62 PDFBibTeX XMLCite \textit{J. Davies} and \textit{R. Mccarty}, Bull. Lond. Math. Soc. 53, No. 3, 673--679 (2021; Zbl 1470.05052) Full Text: DOI arXiv
Zhou, Jiang; Bu, Changjiang The enumeration of spanning tree of weighted graphs. (English) Zbl 1470.05082 J. Algebr. Comb. 54, No. 1, 75-108 (2021). MSC: 05C30 05C31 05C50 05C05 PDFBibTeX XMLCite \textit{J. Zhou} and \textit{C. Bu}, J. Algebr. Comb. 54, No. 1, 75--108 (2021; Zbl 1470.05082) Full Text: DOI
Greaves, Gary R. W.; Koolen, Jack H.; Park, Jongyook Augmenting the Delsarte bound: a forbidden interval for the order of maximal cliques in strongly regular graphs. (English) Zbl 1473.05323 Eur. J. Comb. 97, Article ID 103384, 10 p. (2021). Reviewer: Djoko Suprijanto (Bandung) MSC: 05E30 PDFBibTeX XMLCite \textit{G. R. W. Greaves} et al., Eur. J. Comb. 97, Article ID 103384, 10 p. (2021; Zbl 1473.05323) Full Text: DOI
Koshelev, Mikhail M. Lower bounds on the clique-chromatic numbers of some distance graphs. (English) Zbl 1469.05057 Mosc. J. Comb. Number Theory 10, No. 2, 141-148 (2021). MSC: 05C15 05C12 PDFBibTeX XMLCite \textit{M. M. Koshelev}, Mosc. J. Comb. Number Theory 10, No. 2, 141--148 (2021; Zbl 1469.05057) Full Text: DOI
Misra, Pratik; Sullivant, Seth Gaussian graphical models with toric vanishing ideals. (English) Zbl 1469.62420 Ann. Inst. Stat. Math. 73, No. 4, 757-785 (2021). MSC: 62R01 62H22 05C90 PDFBibTeX XMLCite \textit{P. Misra} and \textit{S. Sullivant}, Ann. Inst. Stat. Math. 73, No. 4, 757--785 (2021; Zbl 1469.62420) Full Text: DOI arXiv
Liu, Qiong; Wu, Tongsuo; Guo, Jin Finite rings whose graphs have clique number less than five. (English) Zbl 1466.13018 Algebra Colloq. 28, No. 3, 533-540 (2021). Reviewer: T. Tamizh Chelvam (Tirunelveli) MSC: 13M05 13M10 13A70 05C69 PDFBibTeX XMLCite \textit{Q. Liu} et al., Algebra Colloq. 28, No. 3, 533--540 (2021; Zbl 1466.13018) Full Text: DOI
Liu, Aming; Wu, Tongsuo A construction of sequentially Cohen-Macaulay graphs. (English) Zbl 1469.13046 Algebra Colloq. 28, No. 3, 399-414 (2021). Reviewer: Jorge Neves (Coimbra) MSC: 13H10 05E45 13F55 05E40 PDFBibTeX XMLCite \textit{A. Liu} and \textit{T. Wu}, Algebra Colloq. 28, No. 3, 399--414 (2021; Zbl 1469.13046) Full Text: DOI arXiv
Pinto, Bruno Q.; Ribeiro, Celso C.; Riveaux, José A.; Rosseti, Isabel A BRKGA-based matheuristic for the maximum quasi-clique problem with an exact local search strategy. (English) Zbl 1469.05135 RAIRO, Oper. Res. 55, Suppl., S741-S763 (2021). MSC: 05C69 05C42 05C85 68T20 90C27 90C59 PDFBibTeX XMLCite \textit{B. Q. Pinto} et al., RAIRO, Oper. Res. 55, S741--S763 (2021; Zbl 1469.05135) Full Text: DOI
Wu, Mingyou; Li, Xi; Liu, Zhihao; Chen, Hanwu Correlation between the continuous-time quantum walk and cliques in graphs and its application. (English) Zbl 1468.81033 Int. J. Quantum Inf. 19, No. 1, Article ID 2150009, 14 p. (2021). MSC: 81P68 05C81 60G50 05C69 PDFBibTeX XMLCite \textit{M. Wu} et al., Int. J. Quantum Inf. 19, No. 1, Article ID 2150009, 14 p. (2021; Zbl 1468.81033) Full Text: DOI
Faal, Hossein Teimoori Clique polynomials of \(2\)-connected \(K_5\)-free chordal graphs. (English) Zbl 1465.05087 J. Algebra Comb. Discrete Struct. Appl. 8, No. 1, 23-29 (2021). MSC: 05C31 05C69 30C15 PDFBibTeX XMLCite \textit{H. T. Faal}, J. Algebra Comb. Discrete Struct. Appl. 8, No. 1, 23--29 (2021; Zbl 1465.05087)
Zhou, Jiang; Bu, Changjiang Eigenvalues and clique partitions of graphs. (English) Zbl 1468.05175 Adv. Appl. Math. 129, Article ID 102220, 12 p. (2021). MSC: 05C50 05C70 PDFBibTeX XMLCite \textit{J. Zhou} and \textit{C. Bu}, Adv. Appl. Math. 129, Article ID 102220, 12 p. (2021; Zbl 1468.05175) Full Text: DOI
Yoo, Semin Graphs associated with orthogonal collections of \(k\)-planes over finite fields. (English) Zbl 1467.05279 Discrete Math. 344, No. 9, Article ID 112496, 3 p. (2021). MSC: 05E30 05C80 51E20 05D10 05C55 PDFBibTeX XMLCite \textit{S. Yoo}, Discrete Math. 344, No. 9, Article ID 112496, 3 p. (2021; Zbl 1467.05279) Full Text: DOI arXiv
Chudnovsky, Maria; Scott, Alex; Seymour, Paul; Spirkl, Sophie A note on simplicial cliques. (English) Zbl 1467.05185 Discrete Math. 344, No. 9, Article ID 112470, 7 p. (2021). MSC: 05C69 05C75 PDFBibTeX XMLCite \textit{M. Chudnovsky} et al., Discrete Math. 344, No. 9, Article ID 112470, 7 p. (2021; Zbl 1467.05185) Full Text: DOI arXiv
Zhang, Richard Y.; Lavaei, Javad Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion. (English) Zbl 1470.90070 Math. Program. 188, No. 1(A), 351-393 (2021). MSC: 90C22 90C35 90C51 90C06 PDFBibTeX XMLCite \textit{R. Y. Zhang} and \textit{J. Lavaei}, Math. Program. 188, No. 1 (A), 351--393 (2021; Zbl 1470.90070) Full Text: DOI arXiv
Yang, Guangbo; Wang, Caishi; Luo, Yan; Wang, Yanyan; Nan, Xueqi 2-tessellable staggered quantum walk on finite even cycles. (Chinese. English summary) Zbl 1474.05365 J. Shandong Univ., Nat. Sci. 56, No. 1, 52-59 (2021). MSC: 05C81 81S20 PDFBibTeX XMLCite \textit{G. Yang} et al., J. Shandong Univ., Nat. Sci. 56, No. 1, 52--59 (2021; Zbl 1474.05365) Full Text: DOI
Chong, Kai Fong Ernest; Nevo, Eran Flag complexes and homology. (English) Zbl 1467.13030 J. Comb. Theory, Ser. A 182, Article ID 105466, 21 p. (2021). MSC: 13F55 05C69 05E45 52Bxx PDFBibTeX XMLCite \textit{K. F. E. Chong} and \textit{E. Nevo}, J. Comb. Theory, Ser. A 182, Article ID 105466, 21 p. (2021; Zbl 1467.13030) Full Text: DOI arXiv
Fomin, Fedor V.; Golovach, Petr A. Subexponential parameterized algorithms and kernelization on almost chordal graphs. (English) Zbl 1467.05254 Algorithmica 83, No. 7, 2170-2214 (2021). MSC: 05C85 05C69 68Q25 PDFBibTeX XMLCite \textit{F. V. Fomin} and \textit{P. A. Golovach}, Algorithmica 83, No. 7, 2170--2214 (2021; Zbl 1467.05254) Full Text: DOI arXiv
Király, Balázs; Szabó, Sándor Lower estimate of clique size via edge coloring. (English) Zbl 1474.05135 Math. Pannonica (N.S.) 27, No. 1, 8-15 (2021). Reviewer: Hang Lau (Montréal) MSC: 05C15 05B45 52C22 PDFBibTeX XMLCite \textit{B. Király} and \textit{S. Szabó}, Math. Pannonica (N.S.) 27, No. 1, 8--15 (2021; Zbl 1474.05135) Full Text: DOI
Kouri, Drew P.; Ridzal, Denis; Tuminaro, Ray KKT preconditioners for PDE-constrained optimization with the Helmholtz equation. (English) Zbl 1477.65179 SIAM J. Sci. Comput. 43, No. 3, S225-S248 (2021). MSC: 65N21 65K10 65F08 65N12 35J05 49M41 49M05 90C46 93B05 93B07 PDFBibTeX XMLCite \textit{D. P. Kouri} et al., SIAM J. Sci. Comput. 43, No. 3, S225--S248 (2021; Zbl 1477.65179) Full Text: DOI
Nassar, Safwat; Yuster, Raphael All feedback arc sets of a random Turán tournament have \(\lfloor{n}/{k}\rfloor-{k}+1\) disjoint \({k}\)-cliques (and this is tight). (English) Zbl 1467.05095 SIAM J. Discrete Math. 35, No. 2, 1460-1477 (2021). MSC: 05C20 05C35 05C80 PDFBibTeX XMLCite \textit{S. Nassar} and \textit{R. Yuster}, SIAM J. Discrete Math. 35, No. 2, 1460--1477 (2021; Zbl 1467.05095) Full Text: DOI arXiv
Kurita, Kazuhiro; Wasa, Kunihiro; Uno, Takeaki; Arimura, Hiroki A constant amortized time enumeration algorithm for independent sets in graphs with bounded clique number. (English) Zbl 1507.05091 Theor. Comput. Sci. 874, 32-41 (2021). MSC: 05C85 05C30 05C69 PDFBibTeX XMLCite \textit{K. Kurita} et al., Theor. Comput. Sci. 874, 32--41 (2021; Zbl 1507.05091) Full Text: DOI arXiv
Baril, Ambroise; Dondi, Riccardo; Hosseinzadeh, Mohammad Mehdi Hardness and tractability of the \(\gamma\)-complete subgraph problem. (English) Zbl 1516.68056 Inf. Process. Lett. 169, Article ID 106105, 9 p. (2021). MSC: 68R10 05C69 05C85 68Q17 68Q27 PDFBibTeX XMLCite \textit{A. Baril} et al., Inf. Process. Lett. 169, Article ID 106105, 9 p. (2021; Zbl 1516.68056) Full Text: DOI
Arambašić, Ljiljana; Guterman, Alexander; Kuzma, Bojan; Rajić, Rajna; Zhilina, Svetlana Symmetrized Birkhoff-James orthogonality in arbitrary normed spaces. (English) Zbl 1489.46019 J. Math. Anal. Appl. 502, No. 1, Article ID 125203, 16 p. (2021). MSC: 46B20 52A21 PDFBibTeX XMLCite \textit{L. Arambašić} et al., J. Math. Anal. Appl. 502, No. 1, Article ID 125203, 16 p. (2021; Zbl 1489.46019) Full Text: DOI
Furini, Fabio; Ljubić, Ivana; San Segundo, Pablo; Zhao, Yanlu A branch-and-cut algorithm for the edge interdiction clique problem. (English) Zbl 1487.90618 Eur. J. Oper. Res. 294, No. 1, 54-69 (2021). MSC: 90C35 05C85 90C27 90C57 PDFBibTeX XMLCite \textit{F. Furini} et al., Eur. J. Oper. Res. 294, No. 1, 54--69 (2021; Zbl 1487.90618) Full Text: DOI Link
Coniglio, Stefano; Furini, Fabio; San Segundo, Pablo A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts. (English) Zbl 1487.90546 Eur. J. Oper. Res. 289, No. 2, 435-455 (2021). MSC: 90C27 90C57 PDFBibTeX XMLCite \textit{S. Coniglio} et al., Eur. J. Oper. Res. 289, No. 2, 435--455 (2021; Zbl 1487.90546) Full Text: DOI Link
Brito, Samuel Souza; Santos, Haroldo Gambini Preprocessing and cutting planes with conflict graphs. (English) Zbl 1510.90189 Comput. Oper. Res. 128, Article ID 105176, 22 p. (2021). MSC: 90C11 90C57 PDFBibTeX XMLCite \textit{S. S. Brito} and \textit{H. G. Santos}, Comput. Oper. Res. 128, Article ID 105176, 22 p. (2021; Zbl 1510.90189) Full Text: DOI arXiv
Chen, Xiaoyu; Zhou, Yi; Hao, Jin-Kao; Xiao, Mingyu Computing maximum \(k\)-defective cliques in massive graphs. (English) Zbl 1510.90278 Comput. Oper. Res. 127, Article ID 105131, 18 p. (2021). MSC: 90C35 05C85 90C27 05C69 PDFBibTeX XMLCite \textit{X. Chen} et al., Comput. Oper. Res. 127, Article ID 105131, 18 p. (2021; Zbl 1510.90278) Full Text: DOI
Marín, Alfredo; Pelegrín, Mercedes The double-assignment plant location problem with co-location. (English) Zbl 1510.90161 Comput. Oper. Res. 126, Article ID 105059, 13 p. (2021). MSC: 90B80 90C10 90C90 PDFBibTeX XMLCite \textit{A. Marín} and \textit{M. Pelegrín}, Comput. Oper. Res. 126, Article ID 105059, 13 p. (2021; Zbl 1510.90161) Full Text: DOI
Huang, Li-Ping Endomorphisms of quadratic forms graph in characteristic two. (English) Zbl 1464.05267 J. Algebr. Comb. 53, No. 1, 59-79 (2021). MSC: 05C60 05E99 05C50 PDFBibTeX XMLCite \textit{L.-P. Huang}, J. Algebr. Comb. 53, No. 1, 59--79 (2021; Zbl 1464.05267) Full Text: DOI
Basnet, Dhiren Kumar; Sharma, Aajay; Dutta, Rahul Nilpotent graph. (English) Zbl 1462.05169 Theory Appl. Graphs 8, No. 1, Article 2, 9 p. (2021). MSC: 05C25 13A99 05C15 05C50 PDFBibTeX XMLCite \textit{D. K. Basnet} et al., Theory Appl. Graphs 8, No. 1, Article 2, 9 p. (2021; Zbl 1462.05169) Full Text: DOI arXiv
Quiroz, Daniel A. Clique immersions in graphs of independence number two with certain forbidden subgraphs. (English) Zbl 1462.05285 Discrete Math. 344, No. 6, Article ID 112365, 9 p. (2021). MSC: 05C69 05C15 PDFBibTeX XMLCite \textit{D. A. Quiroz}, Discrete Math. 344, No. 6, Article ID 112365, 9 p. (2021; Zbl 1462.05285) Full Text: DOI arXiv
Wang, Wei; Yan, Zhidan; Qian, Jianguo Eigenvalues and chromatic number of a signed graph. (English) Zbl 1466.05125 Linear Algebra Appl. 619, 137-145 (2021). Reviewer: Dragan Stevanović (Niš) MSC: 05C50 05C22 PDFBibTeX XMLCite \textit{W. Wang} et al., Linear Algebra Appl. 619, 137--145 (2021; Zbl 1466.05125) Full Text: DOI
Rodrigues, Marcos Okamura Fast constructive and improvement heuristics for edge clique covering. (English) Zbl 1506.05177 Discrete Optim. 39, Article ID 100628, 17 p. (2021). MSC: 05C70 05C35 05C69 05C85 68Q25 68R10 PDFBibTeX XMLCite \textit{M. O. Rodrigues}, Discrete Optim. 39, Article ID 100628, 17 p. (2021; Zbl 1506.05177) Full Text: DOI