Gima, Tatsuya; Hanaka, Tesshu; Kiyomi, Masashi; Kobayashi, Yasuaki; Otachi, Yota Exploring the gap between treedepth and vertex cover through vertex integrity. (English) Zbl 07524431 Theor. Comput. Sci. 918, 60-76 (2022). MSC: 68Qxx PDF BibTeX XML Cite \textit{T. Gima} et al., Theor. Comput. Sci. 918, 60--76 (2022; Zbl 07524431) Full Text: DOI OpenURL
Amiri, Saeed Akhoondian; Wiederhake, Ben Distributed distance-\(r\) covering problems on sparse high-girth graphs. (English) Zbl 07477130 Theor. Comput. Sci. 906, 18-31 (2022). MSC: 68Qxx PDF BibTeX XML Cite \textit{S. A. Amiri} and \textit{B. Wiederhake}, Theor. Comput. Sci. 906, 18--31 (2022; Zbl 07477130) Full Text: DOI OpenURL
Wei, Hao-Ting; Hon, Wing-Kai; Horn, Paul; Liao, Chung-Shou; Sadakane, Kunihiko Approximating dynamic weighted vertex cover with soft capacities. (English) Zbl 07467501 Algorithmica 84, No. 1, 124-149 (2022). MSC: 68Wxx 05Cxx PDF BibTeX XML Cite \textit{H.-T. Wei} et al., Algorithmica 84, No. 1, 124--149 (2022; Zbl 07467501) Full Text: DOI OpenURL
Khosravian Ghadikolaei, Mehdi; Melissinos, Nikolaos; Monnot, Jérôme; Pagourtzis, Aris Extension and its price for the connected vertex cover problem. (English) Zbl 07467464 Theor. Comput. Sci. 904, 66-80 (2022). MSC: 68Qxx PDF BibTeX XML Cite \textit{M. Khosravian Ghadikolaei} et al., Theor. Comput. Sci. 904, 66--80 (2022; Zbl 07467464) Full Text: DOI OpenURL
Frei, Fabian; Hemaspaandra, Edith; Rothe, Jörg Complexity of stability. (English) Zbl 1472.68113 J. Comput. Syst. Sci. 123, 103-121 (2022). MSC: 68R10 68Q25 PDF BibTeX XML Cite \textit{F. Frei} et al., J. Comput. Syst. Sci. 123, 103--121 (2022; Zbl 1472.68113) Full Text: DOI arXiv OpenURL
Kumar, Ajay; Kumar, Rajiv On the powers of vertex cover ideals. (English) Zbl 1468.13026 J. Pure Appl. Algebra 226, No. 1, Article ID 106808, 10 p. (2022). MSC: 13C14 13D02 05E40 PDF BibTeX XML Cite \textit{A. Kumar} and \textit{R. Kumar}, J. Pure Appl. Algebra 226, No. 1, Article ID 106808, 10 p. (2022; Zbl 1468.13026) Full Text: DOI OpenURL
Buzatu, Radu Maximum nontrivial convex cover number of join and corona of graphs. (English) Zbl 07525863 Bul. Acad. Științe Repub. Mold., Mat. 2021, No. 1(95)-2(96), 93-98 (2021). MSC: 68R10 05C35 05C69 05C76 PDF BibTeX XML Cite \textit{R. Buzatu}, Bul. Acad. Științe Repub. Mold., Mat. 2021, No. 1(95)-2(96), 93--98 (2021; Zbl 07525863) Full Text: Link OpenURL
Mei, Yinzhen; Guo, Chengxiao; Liu, Mengtian The bounds of the energy and Laplacian energy of chain graphs. (English) Zbl 07516001 AIMS Math. 6, No. 5, 4847-4859 (2021). MSC: 05C50 05C09 05C92 PDF BibTeX XML Cite \textit{Y. Mei} et al., AIMS Math. 6, No. 5, 4847--4859 (2021; Zbl 07516001) Full Text: DOI OpenURL
Jafarpour-Golzari, Reza; Zaare-Nahandi, Rashid Unmixed \(d\)-uniform \(r\)-partite hypergraphs. (English) Zbl 07511515 Ars Comb. 155, 135-143 (2021). MSC: 05E40 05C65 PDF BibTeX XML Cite \textit{R. Jafarpour-Golzari} and \textit{R. Zaare-Nahandi}, Ars Comb. 155, 135--143 (2021; Zbl 07511515) OpenURL
Mary, V. M. Arul Flower; Leema, J. Anne Mary; Devi, B. Uma; Titus, P. The connected geodetic vertex covering number of a graph. (English) Zbl 07509364 South East Asian J. Math. Math. Sci. 17, No. 1, 285-296 (2021). MSC: 05C12 PDF BibTeX XML Cite \textit{V. M. A. F. Mary} et al., South East Asian J. Math. Math. Sci. 17, No. 1, 285--296 (2021; Zbl 07509364) Full Text: Link OpenURL
Brüstle, Noah; Elbaz, Tal; Hatami, Hamed; Kocer, Onur; Ma, Bingchan Approximation algorithms for hitting subgraphs. (English) Zbl 07495035 Flocchini, Paola (ed.) et al., Combinatorial algorithms. 32nd international workshop, IWOCA 2021, Ottawa, ON, Canada, July 5–7, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12757, 370-384 (2021). MSC: 68Rxx 68Wxx PDF BibTeX XML Cite \textit{N. Brüstle} et al., Lect. Notes Comput. Sci. 12757, 370--384 (2021; Zbl 07495035) Full Text: DOI arXiv OpenURL
Dallard, Clément; Krbezlija, Mirza; Milanič, Martin Vertex cover at distance on \(H\)-free graphs. (English) Zbl 07495026 Flocchini, Paola (ed.) et al., Combinatorial algorithms. 32nd international workshop, IWOCA 2021, Ottawa, ON, Canada, July 5–7, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12757, 237-251 (2021). MSC: 68Rxx 68Wxx PDF BibTeX XML Cite \textit{C. Dallard} et al., Lect. Notes Comput. Sci. 12757, 237--251 (2021; Zbl 07495026) Full Text: DOI OpenURL
Senthilkumar, B.; Naresh Kumar, H.; Venkatakrishnan, Y. B. Vertex cover and edge-vertex domination in trees. (English) Zbl 1482.05262 Proyecciones 40, No. 5, 1147-1154 (2021). MSC: 05C69 05C70 PDF BibTeX XML Cite \textit{B. Senthilkumar} et al., Proyecciones 40, No. 5, 1147--1154 (2021; Zbl 1482.05262) Full Text: DOI OpenURL
Haynes, Teresa W.; Hedetniemi, Stephen T. Vertex sequences in graphs. (English) Zbl 07486957 DML, Discrete Math. Lett. 6, 19-31 (2021). MSC: 05C69 PDF BibTeX XML Cite \textit{T. W. Haynes} and \textit{S. T. Hedetniemi}, DML, Discrete Math. Lett. 6, 19--31 (2021; Zbl 07486957) Full Text: DOI OpenURL
Ceyhan, Elvan; Wierman, John C.; Xiang, Pengfei Law of large numbers for a two-dimensional class cover problem. (English) Zbl 07474300 ESAIM, Probab. Stat. 25, 376-407 (2021). MSC: 60G99 62H30 05C69 PDF BibTeX XML Cite \textit{E. Ceyhan} et al., ESAIM, Probab. Stat. 25, 376--407 (2021; Zbl 07474300) Full Text: DOI OpenURL
Cabrera Martínez, Abel Double outer-independent domination number of graphs. (English) Zbl 1481.05115 Quaest. Math. 44, No. 12, 1835-1850 (2021). MSC: 05C69 05C76 PDF BibTeX XML Cite \textit{A. Cabrera Martínez}, Quaest. Math. 44, No. 12, 1835--1850 (2021; Zbl 1481.05115) Full Text: DOI OpenURL
Daboul, Siad; Held, Stephan; Vygen, Jens Approximating the discrete time-cost tradeoff problem with bounded depth. (English) Zbl 1482.90179 Singh, Mohit (ed.) et al., Integer programming and combinatorial optimization. 22nd international conference, IPCO 2021, Atlanta, GA, USA, May 19–21, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12707, 30-42 (2021). MSC: 90C27 90C90 PDF BibTeX XML Cite \textit{S. Daboul} et al., Lect. Notes Comput. Sci. 12707, 30--42 (2021; Zbl 1482.90179) Full Text: DOI arXiv OpenURL
Gupta, Purnima; Jain, Deepti Graphoidally independent infinite graphs. (English) Zbl 1476.05153 AKCE Int. J. Graphs Comb. 18, No. 2, 95-100 (2021). MSC: 05C69 05C63 PDF BibTeX XML Cite \textit{P. Gupta} and \textit{D. Jain}, AKCE Int. J. Graphs Comb. 18, No. 2, 95--100 (2021; Zbl 1476.05153) Full Text: DOI OpenURL
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 PDF BibTeX XML Cite \textit{K. Betre} and \textit{E. Salinger}, Graphs Comb. 37, No. 6, 2637--2654 (2021; Zbl 1479.05310) Full Text: DOI arXiv OpenURL
Niu, Ruichao; Xu, Min; Lai, Hong-Jian Two-disjoint-cycle-cover vertex bipancyclicity of the bipartite generalized hypercube. (English) Zbl 07423528 Appl. Math. Comput. 400, Article ID 126090, 12 p. (2021). MSC: 05-XX 68-XX PDF BibTeX XML Cite \textit{R. Niu} et al., Appl. Math. Comput. 400, Article ID 126090, 12 p. (2021; Zbl 07423528) Full Text: DOI OpenURL
Diao, Zhuo On the vertex cover number of 3-uniform hypergraph. (English) Zbl 07421473 J. Oper. Res. Soc. China 9, No. 2, 427-440 (2021). MSC: 05C65 05C70 PDF BibTeX XML Cite \textit{Z. Diao}, J. Oper. Res. Soc. China 9, No. 2, 427--440 (2021; Zbl 07421473) Full Text: DOI arXiv OpenURL
Babu, Jasine; Prabhakaran, Veena; Sharma, Arko A substructure based lower bound for eternal vertex cover number. (English) Zbl 07412728 Theor. Comput. Sci. 890, 87-104 (2021). MSC: 68Qxx PDF BibTeX XML Cite \textit{J. Babu} et al., Theor. Comput. Sci. 890, 87--104 (2021; Zbl 07412728) Full Text: DOI OpenURL
Khodkar, Abdollah; Mojdeh, Doost Ali; Samadi, Babak; Yero, Ismael G. Covering Italian domination in graphs. (English) Zbl 1473.05227 Discrete Appl. Math. 304, 324-331 (2021). MSC: 05C69 05C70 05C75 68Q25 68Q17 PDF BibTeX XML Cite \textit{A. Khodkar} et al., Discrete Appl. Math. 304, 324--331 (2021; Zbl 1473.05227) Full Text: DOI arXiv OpenURL
Bermudo, Sergio; Dettlaff, Magda; Lemańska, Magdalena Some variants of perfect graphs related to the matching number, the vertex cover and the weakly connected domination number. (English) Zbl 1473.05100 Discrete Appl. Math. 304, 153-163 (2021). MSC: 05C17 05C70 05C69 PDF BibTeX XML Cite \textit{S. Bermudo} et al., Discrete Appl. Math. 304, 153--163 (2021; Zbl 1473.05100) Full Text: DOI OpenURL
Yin, Huiling; Hao, Binbin; Su, Xiaoyan; Chen, Jingrong Minimum \(k\)-path vertex cover in Cartesian product graphs. (English) Zbl 07404028 J. Math. Res. Appl. 41, No. 4, 340-348 (2021). MSC: 05C70 05C76 PDF BibTeX XML Cite \textit{H. Yin} et al., J. Math. Res. Appl. 41, No. 4, 340--348 (2021; Zbl 07404028) Full Text: DOI OpenURL
Nikolaev, Andrei; Kozlova, Anna Hamiltonian decomposition and verifying vertex adjacency in 1-skeleton of the traveling salesperson polytope by variable neighborhood search. (English) Zbl 1477.90088 J. Comb. Optim. 42, No. 2, 212-230 (2021). MSC: 90C27 PDF BibTeX XML Cite \textit{A. Nikolaev} and \textit{A. Kozlova}, J. Comb. Optim. 42, No. 2, 212--230 (2021; Zbl 1477.90088) Full Text: DOI arXiv OpenURL
Gu, Yan; Hà, Huy Tài; Skelton, Joseph W. Symbolic powers of cover ideals of graphs and Koszul property. (English) Zbl 1476.13018 Int. J. Algebra Comput. 31, No. 5, 865-881 (2021). Reviewer: Fahimeh Khosh-Ahang Ghasr (Ilam) MSC: 13D02 13C13 05E40 05E45 13F55 PDF BibTeX XML Cite \textit{Y. Gu} et al., Int. J. Algebra Comput. 31, No. 5, 865--881 (2021; Zbl 1476.13018) Full Text: DOI arXiv OpenURL
Tsiovkina, Ludmila Yur’evna On a class of vertex-transitive distance-regular covers of complete graphs. (Russian. English summary) Zbl 1468.05024 Sib. Èlektron. Mat. Izv. 18, 758-781 (2021). MSC: 05B25 05E18 PDF BibTeX XML Cite \textit{L. Y. Tsiovkina}, Sib. Èlektron. Mat. Izv. 18, 758--781 (2021; Zbl 1468.05024) Full Text: DOI OpenURL
Zhang, Wenjuan; Li, Jinjin; Lin, Yidong Graph-based granularity reduction in pessimistic multi-granulation rough set. (Chinese. English summary) Zbl 1474.68377 J. Shandong Univ., Nat. Sci. 56, No. 1, 60-67 (2021). MSC: 68T37 PDF BibTeX XML Cite \textit{W. Zhang} et al., J. Shandong Univ., Nat. Sci. 56, No. 1, 60--67 (2021; Zbl 1474.68377) Full Text: DOI OpenURL
Lima, Paloma T.; dos Santos, Vinicius F.; Sau, Ignasi; Souza, Uéverton S. Reducing graph transversals via edge contractions. (English) Zbl 1477.68239 J. Comput. Syst. Sci. 120, 62-74 (2021). MSC: 68R10 68Q17 68Q27 PDF BibTeX XML Cite \textit{P. T. Lima} et al., J. Comput. Syst. Sci. 120, 62--74 (2021; Zbl 1477.68239) Full Text: DOI arXiv OpenURL
Chen, Xiaodan; Liu, Xiaoqian Remarks on the bounds of graph energy in terms of vertex cover number or matching number. (English) Zbl 07361070 Czech. Math. J. 71, No. 2, 309-319 (2021). MSC: 05C50 PDF BibTeX XML Cite \textit{X. Chen} and \textit{X. Liu}, Czech. Math. J. 71, No. 2, 309--319 (2021; Zbl 07361070) Full Text: DOI OpenURL
Cabrera-Martínez, Abel; Rodríguez-Velázquez, Juan Alberto A note on double domination in graphs. (English) Zbl 1465.05124 Discrete Appl. Math. 300, 107-111 (2021). MSC: 05C69 PDF BibTeX XML Cite \textit{A. Cabrera-Martínez} and \textit{J. A. Rodríguez-Velázquez}, Discrete Appl. Math. 300, 107--111 (2021; Zbl 1465.05124) Full Text: DOI arXiv OpenURL
Li, Shuchao; Yu, Yuantian On a poset of trees revisited. (English) Zbl 1462.05090 Adv. Appl. Math. 127, Article ID 102164, 27 p. (2021). MSC: 05C09 05C12 05C05 05C50 06A07 05C69 05C31 PDF BibTeX XML Cite \textit{S. Li} and \textit{Y. Yu}, Adv. Appl. Math. 127, Article ID 102164, 27 p. (2021; Zbl 1462.05090) Full Text: DOI OpenURL
Shi, Feng; Neumann, Frank; Wang, Jianxin Runtime performances of randomized search heuristics for the dynamic weighted vertex cover problem. (English) Zbl 07331690 Algorithmica 83, No. 4, 906-939 (2021). MSC: 68Wxx 05Cxx PDF BibTeX XML Cite \textit{F. Shi} et al., Algorithmica 83, No. 4, 906--939 (2021; Zbl 07331690) Full Text: DOI arXiv OpenURL
Hà, Huy Tài; Hibi, Takayuki MAX MIN vertex cover and the size of Betti tables. (English) Zbl 1467.13031 Ann. Comb. 25, No. 1, 115-132 (2021). Reviewer: S. A. Seyed Fakhari (Tehran) MSC: 13F55 13D02 05C70 05E40 PDF BibTeX XML Cite \textit{H. T. Hà} and \textit{T. Hibi}, Ann. Comb. 25, No. 1, 115--132 (2021; Zbl 1467.13031) Full Text: DOI arXiv OpenURL
Rozenshtein, Polina; Tatti, Nikolaj; Gionis, Aristides The network-untangling problem: from interactions to activity timelines. (English) Zbl 1472.68120 Data Min. Knowl. Discov. 35, No. 1, 213-247 (2021). MSC: 68R10 05C82 68Q17 68Q25 68W25 90C35 PDF BibTeX XML Cite \textit{P. Rozenshtein} et al., Data Min. Knowl. Discov. 35, No. 1, 213--247 (2021; Zbl 1472.68120) Full Text: DOI Link OpenURL
Henning, Michael A.; Rad, Nader Jafari Upper bounds on the \(k\)-tuple (Roman) domination number of a graph. (English) Zbl 1459.05239 Graphs Comb. 37, No. 1, 325-336 (2021). MSC: 05C69 PDF BibTeX XML Cite \textit{M. A. Henning} and \textit{N. J. Rad}, Graphs Comb. 37, No. 1, 325--336 (2021; Zbl 1459.05239) Full Text: DOI OpenURL
Milanič, Martin; Pivač, Nevena Polynomially bounding the number of minimal separators in graphs: reductions, sufficient conditions, and a dichotomy theorem. (English) Zbl 1459.05277 Electron. J. Comb. 28, No. 1, Research Paper P1.41, 27 p. (2021). MSC: 05C75 05C40 05C30 05C76 05C69 PDF BibTeX XML Cite \textit{M. Milanič} and \textit{N. Pivač}, Electron. J. Comb. 28, No. 1, Research Paper P1.41, 27 p. (2021; Zbl 1459.05277) Full Text: DOI OpenURL
Spiga, Pablo; Xia, Binzhou Constructing infinitely many half-arc-transitive covers of tetravalent graphs. (English) Zbl 07313981 J. Comb. Theory, Ser. A 180, Article ID 105406, 17 p. (2021). MSC: 68Wxx PDF BibTeX XML Cite \textit{P. Spiga} and \textit{B. Xia}, J. Comb. Theory, Ser. A 180, Article ID 105406, 17 p. (2021; Zbl 07313981) Full Text: DOI arXiv OpenURL
Samanta, Aniruddha; Kannan, M. Rajesh Bounds for the energy of a complex unit gain graph. (English) Zbl 1459.05185 Linear Algebra Appl. 612, 1-29 (2021). MSC: 05C50 05C22 05C35 PDF BibTeX XML Cite \textit{A. Samanta} and \textit{M. R. Kannan}, Linear Algebra Appl. 612, 1--29 (2021; Zbl 1459.05185) Full Text: DOI arXiv OpenURL
Bishnoi, Anurag; Das, Shagnik; Morris, Patrick; Szabó, Tibor Ryser’s conjecture for \(t\)-intersecting hypergraphs. (English) Zbl 1457.05072 J. Comb. Theory, Ser. A 179, Article ID 105366, 24 p. (2021). MSC: 05C65 PDF BibTeX XML Cite \textit{A. Bishnoi} et al., J. Comb. Theory, Ser. A 179, Article ID 105366, 24 p. (2021; Zbl 1457.05072) Full Text: DOI arXiv OpenURL
Kao, Mong-Jen Iterative partial rounding for vertex cover with hard capacities. (English) Zbl 07303843 Algorithmica 83, No. 1, 45-71 (2021). MSC: 68Wxx 05Cxx PDF BibTeX XML Cite \textit{M.-J. Kao}, Algorithmica 83, No. 1, 45--71 (2021; Zbl 07303843) Full Text: DOI arXiv OpenURL
Glazik, Christian; Jäger, Gerold; Schiemann, Jan; Srivastav, Anand Bounds for the static permutation mastermind game. (English) Zbl 1457.91114 Discrete Math. 344, No. 3, Article ID 112253, 13 p. (2021). MSC: 91A46 91A05 PDF BibTeX XML Cite \textit{C. Glazik} et al., Discrete Math. 344, No. 3, Article ID 112253, 13 p. (2021; Zbl 1457.91114) Full Text: DOI OpenURL
Cabrera Martínez, Abel; Kuziak, Dorota; Yero, Ismael G. A constructive characterization of vertex cover Roman trees. (English) Zbl 1453.05086 Discuss. Math., Graph Theory 41, No. 1, 267-283 (2021). MSC: 05C69 05C05 05C75 05C70 PDF BibTeX XML Cite \textit{A. Cabrera Martínez} et al., Discuss. Math., Graph Theory 41, No. 1, 267--283 (2021; Zbl 1453.05086) Full Text: DOI OpenURL
Klostermeyer, William F.; Messinger, Margaret-Ellen; Yeo, Anders Dominating vertex covers: the vertex-edge domination problem. (English) Zbl 1464.05293 Discuss. Math., Graph Theory 41, No. 1, 123-132 (2021). Reviewer: Venkatakrishnan Yanamandram (Tiruchirappalli) MSC: 05C69 05C70 68Q17 PDF BibTeX XML Cite \textit{W. F. Klostermeyer} et al., Discuss. Math., Graph Theory 41, No. 1, 123--132 (2021; Zbl 1464.05293) Full Text: DOI OpenURL
Boros, Endre; Gurvich, Vladimir; Milanič, Martin Characterizing and decomposing classes of threshold, split, and bipartite graphs via 1-Sperner hypergraphs. (English) Zbl 07500664 J. Graph Theory 94, No. 3, 364-397 (2020). MSC: 05C65 05C70 05C69 PDF BibTeX XML Cite \textit{E. Boros} et al., J. Graph Theory 94, No. 3, 364--397 (2020; Zbl 07500664) Full Text: DOI OpenURL
Bhore, Sujoy; Ganian, Robert; Montecchiani, Fabrizio; Nöllenburg, Martin Parameterized algorithms for queue layouts. (English) Zbl 07436606 Auber, David (ed.) et al., Graph drawing and network visualization. 28th international symposium, GD 2020, Vancouver, BC, Canada, September 16–18, 2020. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 12590, 40-54 (2020). MSC: 68R10 68U05 PDF BibTeX XML Cite \textit{S. Bhore} et al., Lect. Notes Comput. Sci. 12590, 40--54 (2020; Zbl 07436606) Full Text: DOI arXiv OpenURL
Ekinci, Gülnaz Boruzanlı; Bujtás, Csilla Bipartite graphs with close domination and \(k\)-domination numbers. (English) Zbl 1475.05131 Open Math. 18, 873-885 (2020). MSC: 05C69 05C75 68Q25 PDF BibTeX XML Cite \textit{G. B. Ekinci} and \textit{C. Bujtás}, Open Math. 18, 873--885 (2020; Zbl 1475.05131) Full Text: DOI arXiv OpenURL
Babu, Jasine; Prabhakaran, Veena A new lower bound for the eternal vertex cover number of graphs. (English) Zbl 07336092 Kim, Donghyun (ed.) et al., Computing and combinatorics. 26th international conference, COCOON 2020, Atlanta, GA, USA, August 29–31, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12273, 27-39 (2020). MSC: 68Rxx PDF BibTeX XML Cite \textit{J. Babu} and \textit{V. Prabhakaran}, Lect. Notes Comput. Sci. 12273, 27--39 (2020; Zbl 07336092) Full Text: DOI arXiv OpenURL
Kamath, S. S.; Thilak, A. Senthil; Rashmi, M. Algorithmic aspects of \(k\)-part degree restricted domination in graphs. (English) Zbl 1457.05078 Discrete Math. Algorithms Appl. 12, No. 5, Article ID 2050057, 16 p. (2020). MSC: 05C69 05C85 68Q17 PDF BibTeX XML Cite \textit{S. S. Kamath} et al., Discrete Math. Algorithms Appl. 12, No. 5, Article ID 2050057, 16 p. (2020; Zbl 1457.05078) Full Text: DOI OpenURL
Wei, Wei; Li, Shuchao Relation between the Hermitian energy of a mixed graph and the matching number of its underlying graph. (English) Zbl 1459.05194 Linear Multilinear Algebra 68, No. 7, 1395-1410 (2020). MSC: 05C50 05C70 05C35 05C75 PDF BibTeX XML Cite \textit{W. Wei} and \textit{S. Li}, Linear Multilinear Algebra 68, No. 7, 1395--1410 (2020; Zbl 1459.05194) Full Text: DOI OpenURL
Amin, Ruhul; Abu Nayeem, Sk. Md. Bounds for Kirchhoff index and Laplacian-energy-like invariant of some derived graphs of a regular graph. (English) Zbl 1456.05084 Discrete Math. Algorithms Appl. 12, No. 2, Article ID 2050022, 23 p. (2020). MSC: 05C35 05C07 05C40 PDF BibTeX XML Cite \textit{R. Amin} and \textit{Sk. Md. Abu Nayeem}, Discrete Math. Algorithms Appl. 12, No. 2, Article ID 2050022, 23 p. (2020; Zbl 1456.05084) Full Text: DOI OpenURL
Zhu, Zheng; Fang, Chao; Katzgraber, Helmut G. \(\boldsymbol{borealis}\) – a generalized global update algorithm for Boolean optimization problems. (English) Zbl 1460.90110 Optim. Lett. 14, No. 8, 2495-2514 (2020). MSC: 90C09 90C59 PDF BibTeX XML Cite \textit{Z. Zhu} et al., Optim. Lett. 14, No. 8, 2495--2514 (2020; Zbl 1460.90110) Full Text: DOI arXiv OpenURL
Walteros, Jose L.; Buchanan, Austin Why is maximum clique often easy in practice? (English) Zbl 1457.90166 Oper. Res. 68, No. 6, 1866-1895 (2020). MSC: 90C35 90C27 PDF BibTeX XML Cite \textit{J. L. Walteros} and \textit{A. Buchanan}, Oper. Res. 68, No. 6, 1866--1895 (2020; Zbl 1457.90166) Full Text: DOI OpenURL
Kamčev, Nina; Krivelevich, Michael; Morrison, Natasha; Sudakov, Benny The Kőnig graph process. (English) Zbl 1454.05112 Random Struct. Algorithms 57, No. 4, 1272-1302 (2020). MSC: 05C80 05C70 PDF BibTeX XML Cite \textit{N. Kamčev} et al., Random Struct. Algorithms 57, No. 4, 1272--1302 (2020; Zbl 1454.05112) Full Text: DOI arXiv OpenURL
Kompišová, Anna; Lukot’ka, Robert Short cycle covers of graphs with at most 77% vertices of degree two. (English) Zbl 1453.05053 Electron. J. Comb. 27, No. 4, Research Paper P4.31, 7 p. (2020). MSC: 05C38 05C12 05C70 05C07 PDF BibTeX XML Cite \textit{A. Kompišová} and \textit{R. Lukot'ka}, Electron. J. Comb. 27, No. 4, Research Paper P4.31, 7 p. (2020; Zbl 1453.05053) Full Text: DOI OpenURL
Hermon, Jonathan A spectral characterization for concentration of the cover time. (English) Zbl 1469.60232 J. Theor. Probab. 33, No. 4, 2167-2184 (2020). MSC: 60J10 60J27 PDF BibTeX XML Cite \textit{J. Hermon}, J. Theor. Probab. 33, No. 4, 2167--2184 (2020; Zbl 1469.60232) Full Text: DOI arXiv OpenURL
Asahiro, Yuichi; Jansson, Jesper; Miyano, Eiji; Nikpey, Hesam; Ono, Hirotaka Graph orientation with splits. (English) Zbl 1464.68273 Theor. Comput. Sci. 844, 16-25 (2020). MSC: 68R10 05C20 05C22 68Q25 90C27 PDF BibTeX XML Cite \textit{Y. Asahiro} et al., Theor. Comput. Sci. 844, 16--25 (2020; Zbl 1464.68273) Full Text: DOI OpenURL
Selvaraja, S. Symbolic powers of vertex cover ideals. (English) Zbl 1445.13016 Int. J. Algebra Comput. 30, No. 6, 1167-1183 (2020). Reviewer: Jorge Neves (Coimbra) MSC: 13D02 13F20 PDF BibTeX XML Cite \textit{S. Selvaraja}, Int. J. Algebra Comput. 30, No. 6, 1167--1183 (2020; Zbl 1445.13016) Full Text: DOI arXiv OpenURL
Liu, Pengcheng; Zhang, Zhao; Li, Xianyue; Wu, Weili Approximation algorithm for minimum connected 3-path vertex cover. (English) Zbl 1448.05164 Discrete Appl. Math. 287, 77-84 (2020). MSC: 05C70 05C85 05C40 68W25 PDF BibTeX XML Cite \textit{P. Liu} et al., Discrete Appl. Math. 287, 77--84 (2020; Zbl 1448.05164) Full Text: DOI OpenURL
Zhang, An; Chen, Yong; Chen, Zhi-Zhong; Lin, Guohui Improved approximation algorithms for path vertex covers in regular graphs. (English) Zbl 1455.68152 Algorithmica 82, No. 10, 3041-3064 (2020). MSC: 68R10 05C69 05C70 68W25 PDF BibTeX XML Cite \textit{A. Zhang} et al., Algorithmica 82, No. 10, 3041--3064 (2020; Zbl 1455.68152) Full Text: DOI arXiv OpenURL
Majumdar, Diptapriyo; Ramanujan, M. S.; Saurabh, Saket On the approximate compressibility of connected vertex cover. (English) Zbl 1455.68144 Algorithmica 82, No. 10, 2902-2926 (2020). MSC: 68R10 05C70 68Q27 PDF BibTeX XML Cite \textit{D. Majumdar} et al., Algorithmica 82, No. 10, 2902--2926 (2020; Zbl 1455.68144) Full Text: DOI arXiv OpenURL
Xiao, Han; Fang, Qizhi; Du, Ding-Zhu Population monotonic allocation schemes for vertex cover games. (English) Zbl 1456.91057 Theor. Comput. Sci. 842, 41-49 (2020). MSC: 91B32 91A12 91A43 05C90 PDF BibTeX XML Cite \textit{H. Xiao} et al., Theor. Comput. Sci. 842, 41--49 (2020; Zbl 1456.91057) Full Text: DOI arXiv OpenURL
Jain, Pallavi; Kanesh, Lawqueen; Misra, Pranabendu Conflict free version of covering problems on graphs: classical and parameterized. (English) Zbl 1453.68136 Theory Comput. Syst. 64, No. 6, 1067-1093 (2020). MSC: 68R10 05C70 68Q27 PDF BibTeX XML Cite \textit{P. Jain} et al., Theory Comput. Syst. 64, No. 6, 1067--1093 (2020; Zbl 1453.68136) Full Text: DOI OpenURL
Mokeev, D. B.; Malyshev, D. S. A polynomial-time algorithm of finding a minimum \(k\)-path vertex cover and a maximum \(k\)-path packing in some graphs. (English) Zbl 1448.90084 Optim. Lett. 14, No. 6, 1317-1322 (2020). MSC: 90C27 90C35 90C60 PDF BibTeX XML Cite \textit{D. B. Mokeev} and \textit{D. S. Malyshev}, Optim. Lett. 14, No. 6, 1317--1322 (2020; Zbl 1448.90084) Full Text: DOI OpenURL
Zhang, Shaopu; Sun, Pin; Feng, Tao A graph approach for attribute reduction of Pythagorean fuzzy information systems. (Chinese. English summary) Zbl 1449.68109 J. Zhengzhou Univ., Nat. Sci. Ed. 52, No. 1, 79-86, 113 (2020). MSC: 68T37 68R10 PDF BibTeX XML Cite \textit{S. Zhang} et al., J. Zhengzhou Univ., Nat. Sci. Ed. 52, No. 1, 79--86, 113 (2020; Zbl 1449.68109) Full Text: DOI OpenURL
Bringmann, Karl; Husfeldt, Thore; Magnusson, Måns Multivariate analysis of orthogonal range searching and graph distances. (English) Zbl 1452.68134 Algorithmica 82, No. 8, 2292-2315 (2020). MSC: 68R10 05C09 05C12 68P05 68Q25 68U05 PDF BibTeX XML Cite \textit{K. Bringmann} et al., Algorithmica 82, No. 8, 2292--2315 (2020; Zbl 1452.68134) Full Text: DOI OpenURL
Meeks, Kitty; Skerman, Fiona The parameterised complexity of computing the maximum modularity of a graph. (English) Zbl 1452.68091 Algorithmica 82, No. 8, 2174-2199 (2020). MSC: 68Q27 68R10 68W25 PDF BibTeX XML Cite \textit{K. Meeks} and \textit{F. Skerman}, Algorithmica 82, No. 8, 2174--2199 (2020; Zbl 1452.68091) Full Text: DOI OpenURL
Chen, Xue-Gang; Sohn, Moo Young; Wang, Yu-Feng Total domination number of central trees. (English) Zbl 1446.05069 Bull. Korean Math. Soc. 57, No. 1, 245-250 (2020). Reviewer: Doost Ali Mojdeh (Babolsar) MSC: 05C69 05C35 PDF BibTeX XML Cite \textit{X.-G. Chen} et al., Bull. Korean Math. Soc. 57, No. 1, 245--250 (2020; Zbl 1446.05069) Full Text: DOI OpenURL
Hoang, Duc A.; Suzuki, Akira; Yagita, Tsuyoshi Reconfiguring \(k\)-path vertex covers. (English) Zbl 07224279 Rahman, M. Sohel (ed.) et al., WALCOM: algorithms and computation. 14th international conference, WALCOM 2020, Singapore, Singapore, March 31 – April 2, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12049, 133-145 (2020). MSC: 68Wxx PDF BibTeX XML Cite \textit{D. A. Hoang} et al., Lect. Notes Comput. Sci. 12049, 133--145 (2020; Zbl 07224279) Full Text: DOI arXiv OpenURL
Kaur, Chamanvir; Misra, Neeldhara On the parameterized complexity of spanning trees with small vertex covers. (English) Zbl 1453.68096 Changat, Manoj (ed.) et al., Algorithms and discrete applied mathematics. 6th international conference, CALDAM 2020, Hyderabad, India, February 13–15, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12016, 427-438 (2020). MSC: 68Q27 05C05 05C85 68Q17 68R10 68W25 PDF BibTeX XML Cite \textit{C. Kaur} and \textit{N. Misra}, Lect. Notes Comput. Sci. 12016, 427--438 (2020; Zbl 1453.68096) Full Text: DOI OpenURL
Abu-Khzam, Faisal N.; Bazgan, Cristina; Fernau, Henning Parameterized dynamic variants of red-blue dominating set. (English) Zbl 1440.68134 Chatzigeorgiou, Alexander (ed.) et al., SOFSEM 2020: theory and practice of computer science. 46th international conference on current trends in theory and practice of informatics, SOFSEM 2020, Limassol, Cyprus, January 20–24, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12011, 236-247 (2020). MSC: 68Q27 05C69 PDF BibTeX XML Cite \textit{F. N. Abu-Khzam} et al., Lect. Notes Comput. Sci. 12011, 236--247 (2020; Zbl 1440.68134) Full Text: DOI OpenURL
Chen, Xiaodong; Liu, Mingda; Liu, Huiqing Minimum path cover in quasi-claw-free graphs. (English) Zbl 1457.05084 Bull. Iran. Math. Soc. 46, No. 3, 815-820 (2020). Reviewer: Ko-Wei Lih (Taipei) MSC: 05C70 05C38 PDF BibTeX XML Cite \textit{X. Chen} et al., Bull. Iran. Math. Soc. 46, No. 3, 815--820 (2020; Zbl 1457.05084) Full Text: DOI OpenURL
Beeler, Robert A.; Haynes, Teresa W.; Henning, Michael A.; Keaton, Rodney Total domination cover rubbling. (English) Zbl 1442.05147 Discrete Appl. Math. 283, 133-141 (2020). MSC: 05C69 05C40 05C57 PDF BibTeX XML Cite \textit{R. A. Beeler} et al., Discrete Appl. Math. 283, 133--141 (2020; Zbl 1442.05147) Full Text: DOI OpenURL
Wei, Chao; Hao, Rong-Xia; Chang, Jou-Ming Two-disjoint-cycle-cover bipancyclicity of balanced hypercubes. (English) Zbl 07208690 Appl. Math. Comput. 381, Article ID 125305, 12 p. (2020). MSC: 00-XX PDF BibTeX XML Cite \textit{C. Wei} et al., Appl. Math. Comput. 381, Article ID 125305, 12 p. (2020; Zbl 07208690) Full Text: DOI OpenURL
Pourhassan, Mojgan; Roostapour, Vahid; Neumann, Frank Runtime analysis of RLS and \((1 + 1)\) EA for the dynamic weighted vertex cover problem. (English) Zbl 1443.68229 Theor. Comput. Sci. 832, 20-41 (2020). MSC: 68W50 68W40 90C27 90C59 PDF BibTeX XML Cite \textit{M. Pourhassan} et al., Theor. Comput. Sci. 832, 20--41 (2020; Zbl 1443.68229) Full Text: DOI arXiv OpenURL
Klobučar, Ana; Manger, Robert Independent sets and vertex covers considered within the context of robust optimization. (English) Zbl 1443.90296 Math. Commun. 25, No. 1, 67-86 (2020). MSC: 90C27 90C17 90C35 90C29 05C22 05C69 PDF BibTeX XML Cite \textit{A. Klobučar} and \textit{R. Manger}, Math. Commun. 25, No. 1, 67--86 (2020; Zbl 1443.90296) Full Text: Link OpenURL
Georgiou, Konstantinos; Jiang, Andy (Jia); Lee, Edward; Olave, Astrid A.; Seong, Ian; Upadhyaya, Twesh Lift & project systems performing on the partial-vertex-cover polytope. (English) Zbl 1433.90134 Theor. Comput. Sci. 820, 1-16 (2020). MSC: 90C27 05C70 68Q17 68W25 90C22 90C35 PDF BibTeX XML Cite \textit{K. Georgiou} et al., Theor. Comput. Sci. 820, 1--16 (2020; Zbl 1433.90134) Full Text: DOI arXiv Link OpenURL
Masařík, Tomáš; Toufar, Tomáš Parameterized complexity of fair deletion problems. (English) Zbl 1437.05227 Discrete Appl. Math. 278, 51-61 (2020). MSC: 05C99 68Q27 PDF BibTeX XML Cite \textit{T. Masařík} and \textit{T. Toufar}, Discrete Appl. Math. 278, 51--61 (2020; Zbl 1437.05227) Full Text: DOI arXiv OpenURL
Pilipczuk, Michał; van Leeuwen, Erik Jan; Wiese, Andreas Quasi-polynomial time approximation schemes for packing and covering problems in planar graphs. (English) Zbl 1433.68307 Algorithmica 82, No. 6, 1703-1739 (2020). MSC: 68R10 05C10 05C69 05C70 05C85 68U05 68W25 PDF BibTeX XML Cite \textit{M. Pilipczuk} et al., Algorithmica 82, No. 6, 1703--1739 (2020; Zbl 1433.68307) Full Text: DOI Link OpenURL
Bhattacharya, Sayan; Chakrabarty, Deeparnab; Henzinger, Monika Deterministic dynamic matching in \(O(1)\) update time. (English) Zbl 1435.68226 Algorithmica 82, No. 4, 1057-1080 (2020). MSC: 68R10 05C70 05C85 68P05 68W25 68W40 PDF BibTeX XML Cite \textit{S. Bhattacharya} et al., Algorithmica 82, No. 4, 1057--1080 (2020; Zbl 1435.68226) Full Text: DOI OpenURL
Cao, Fayun; Ren, Han Nonseparating independent sets of Cartesian product graphs. (English) Zbl 1434.05106 Taiwanese J. Math. 24, No. 1, 1-17 (2020). MSC: 05C69 05C70 05C76 05C05 05C40 PDF BibTeX XML Cite \textit{F. Cao} and \textit{H. Ren}, Taiwanese J. Math. 24, No. 1, 1--17 (2020; Zbl 1434.05106) Full Text: DOI Euclid OpenURL
Zhang, Yubai; Zhang, Zhao; Shi, Yishuo; Li, Xianyue Algorithm for online 3-path vertex cover. (English) Zbl 1434.68696 Theory Comput. Syst. 64, No. 2, 327-338 (2020). MSC: 68W27 05C70 05C85 68R10 PDF BibTeX XML Cite \textit{Y. Zhang} et al., Theory Comput. Syst. 64, No. 2, 327--338 (2020; Zbl 1434.68696) Full Text: DOI OpenURL
Li, Shuchao; Wang, Shujing Extremal cover cost and reverse cover cost of trees with given segment sequence. (English) Zbl 1434.05138 Discrete Math. 343, No. 4, Article ID 111791, 13 p. (2020). MSC: 05C81 05C40 05C05 05C07 PDF BibTeX XML Cite \textit{S. Li} and \textit{S. Wang}, Discrete Math. 343, No. 4, Article ID 111791, 13 p. (2020; Zbl 1434.05138) Full Text: DOI OpenURL
Khoshkhah, Kaveh; Ghadikolaei, Mehdi Khosravian; Monnot, Jérôme; Sikora, Florian Weighted upper edge cover: complexity and approximability. (English) Zbl 1433.05261 J. Graph Algorithms Appl. 24, No. 2, 65-88 (2020). MSC: 05C70 05C69 05C22 PDF BibTeX XML Cite \textit{K. Khoshkhah} et al., J. Graph Algorithms Appl. 24, No. 2, 65--88 (2020; Zbl 1433.05261) Full Text: DOI OpenURL
Davila, Randy; Henning, Michael A. Matching, path covers, and total forcing sets. (English) Zbl 1432.05039 Quaest. Math. 43, No. 1, 131-147 (2020). MSC: 05C15 05C70 05C69 PDF BibTeX XML Cite \textit{R. Davila} and \textit{M. A. Henning}, Quaest. Math. 43, No. 1, 131--147 (2020; Zbl 1432.05039) Full Text: DOI arXiv OpenURL
Choi, Ilkyoo; Kim, Jinha; Park, Boram Collapsibility of non-cover complexes of graphs. (English) Zbl 1431.05111 Electron. J. Comb. 27, No. 1, Research Paper P1.20, 8 p. (2020). MSC: 05C69 05E45 PDF BibTeX XML Cite \textit{I. Choi} et al., Electron. J. Comb. 27, No. 1, Research Paper P1.20, 8 p. (2020; Zbl 1431.05111) Full Text: arXiv Link OpenURL
Conte, Alessio; Grossi, Roberto; Marino, Andrea Large-scale clique cover of real-world networks. (English) Zbl 1436.68228 Inf. Comput. 270, Article ID 104464, 15 p. (2020). MSC: 68R10 05C69 05C70 05C85 68W40 PDF BibTeX XML Cite \textit{A. Conte} et al., Inf. Comput. 270, Article ID 104464, 15 p. (2020; Zbl 1436.68228) Full Text: DOI OpenURL
Johnson, Matthew; Paesani, Giacomo; Paulusma, Daniël Connected vertex cover for \((sP_1+P_5)\)-free graphs. (English) Zbl 1436.68245 Algorithmica 82, No. 1, 20-40 (2020). MSC: 68R10 05C70 05C85 68W40 PDF BibTeX XML Cite \textit{M. Johnson} et al., Algorithmica 82, No. 1, 20--40 (2020; Zbl 1436.68245) Full Text: DOI Link OpenURL
Li, Shudong; Zhao, Dawei; Wu, Xiaobo; Tian, Zhihong; Li, Aiping; Wang, Zhen Functional immunization of networks based on message passing. (English) Zbl 1433.91115 Appl. Math. Comput. 366, Article ID 124728, 8 p. (2020). MSC: 91D30 92D30 05C82 37N25 PDF BibTeX XML Cite \textit{S. Li} et al., Appl. Math. Comput. 366, Article ID 124728, 8 p. (2020; Zbl 1433.91115) Full Text: DOI OpenURL
Dau, Hoang; Milenkovic, Olgica; Puleo, Gregory J. On the triangle clique cover and \(K_t\) clique cover problems. (English) Zbl 1429.05160 Discrete Math. 343, No. 1, Article ID 111627, 11 p. (2020). MSC: 05C70 05C69 68Q17 90C35 PDF BibTeX XML Cite \textit{H. Dau} et al., Discrete Math. 343, No. 1, Article ID 111627, 11 p. (2020; Zbl 1429.05160) Full Text: DOI arXiv OpenURL
Akrida, Eleni C.; Mertzios, George B.; Spirakis, Paul G.; Zamaraev, Viktor Temporal vertex cover with a sliding time window. (English) Zbl 1436.68219 J. Comput. Syst. Sci. 107, 108-123 (2020). MSC: 68R10 05C70 68Q17 68W25 PDF BibTeX XML Cite \textit{E. C. Akrida} et al., J. Comput. Syst. Sci. 107, 108--123 (2020; Zbl 1436.68219) Full Text: DOI arXiv Link OpenURL
Angelidakis, Haris; Awasthi, Pranjal; Blum, Avrim; Chatziafratis, Vaggos; Dan, Chen Bilu-Linial stability, certified algorithms and the independent set problem. (English) Zbl 07525444 Bender, Michael A. (ed.) et al., 27th annual European symposium on algorithms, ESA 2019, Munich/Garching, Germany, September 9–11, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 144, Article 7, 16 p. (2019). MSC: 68Wxx PDF BibTeX XML Cite \textit{H. Angelidakis} et al., LIPIcs -- Leibniz Int. Proc. Inform. 144, Article 7, 16 p. (2019; Zbl 07525444) Full Text: DOI OpenURL
Meeks, Kitty; Skerman, Fiona The parameterised complexity of computing the maximum modularity of a graph. (English) Zbl 07378595 Paul, Christophe (ed.) et al., 13th international symposium on parameterized and exact computation, IPEC 2018, August 22–24, 2018, Helsinki, Finland. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 115, Article 9, 14 p. (2019). MSC: 68Q25 68Wxx PDF BibTeX XML Cite \textit{K. Meeks} and \textit{F. Skerman}, LIPIcs -- Leibniz Int. Proc. Inform. 115, Article 9, 14 p. (2019; Zbl 07378595) Full Text: DOI arXiv OpenURL
Bringmann, Karl; Husfeldt, Thore; Magnusson, Måns Multivariate analysis of orthogonal range searching and graph distances. (English) Zbl 07378590 Paul, Christophe (ed.) et al., 13th international symposium on parameterized and exact computation, IPEC 2018, August 22–24, 2018, Helsinki, Finland. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 115, Article 4, 13 p. (2019). MSC: 68Q25 68Wxx PDF BibTeX XML Cite \textit{K. Bringmann} et al., LIPIcs -- Leibniz Int. Proc. Inform. 115, Article 4, 13 p. (2019; Zbl 07378590) Full Text: DOI OpenURL
Jin, Dannielle D. D.; Wang, David G. L. On the minimum vertex cover of generalized Petersen graphs. (English) Zbl 1464.05307 Discrete Appl. Math. 266, 309-318 (2019). MSC: 05C70 05C35 05C69 PDF BibTeX XML Cite \textit{D. D. D. Jin} and \textit{D. G. L. Wang}, Discrete Appl. Math. 266, 309--318 (2019; Zbl 1464.05307) Full Text: DOI OpenURL
Ben Basat, Ran; Even, Guy; Kawarabayashi, Ken-ichi; Schwartzman, Gregory Optimal distributed covering algorithms. (English) Zbl 07298661 Nowak, Thomas (ed.), Proceedings of the 38th ACM symposium on principles of distributed computing, PODC ’19, Toronto, ON, Canada, July 29 – August 2, 2019. New York, NY: Association for Computing Machinery (ACM). 104-106 (2019). MSC: 68M14 68W15 PDF BibTeX XML Cite \textit{R. Ben Basat} et al., in: Proceedings of the 38th ACM symposium on principles of distributed computing, PODC '19, Toronto, ON, Canada, July 29 -- August 2, 2019. New York, NY: Association for Computing Machinery (ACM). 104--106 (2019; Zbl 07298661) Full Text: DOI arXiv Link OpenURL
Jafarpour-Golzari, Reza A generalization of Hall’s theorem for \(k\)-uniform \(k\)-partite hypergraphs. (English) Zbl 1463.05386 Trans. Comb. 8, No. 3, 23-28 (2019). MSC: 05C65 05C70 PDF BibTeX XML Cite \textit{R. Jafarpour-Golzari}, Trans. Comb. 8, No. 3, 23--28 (2019; Zbl 1463.05386) Full Text: DOI arXiv OpenURL
Jahari, Somayeh; Alikhani, Saeid Domination polynomial of clique cover product of graphs. (English) Zbl 1446.05067 Algebra Discrete Math. 28, No. 2, 248-259 (2019). MSC: 05C60 05C69 PDF BibTeX XML Cite \textit{S. Jahari} and \textit{S. Alikhani}, Algebra Discrete Math. 28, No. 2, 248--259 (2019; Zbl 1446.05067) Full Text: arXiv Link OpenURL
Hliněný, Petr; Sankaran, Abhisekh Exact crossing number parameterized by vertex cover. (English) Zbl 07266125 Archambault, Daniel (ed.) et al., Graph drawing and network visualization. 27th international symposium, GD 2019, Prague, Czech Republic, September 17–20, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11904, 307-319 (2019). MSC: 68R10 68U05 PDF BibTeX XML Cite \textit{P. Hliněný} and \textit{A. Sankaran}, Lect. Notes Comput. Sci. 11904, 307--319 (2019; Zbl 07266125) Full Text: DOI arXiv OpenURL