Jaume, Daniel A.; Molina, Gonzalo; Pastine, Adrián Null decomposition of bipartite graphs without cycles of length 0 modulo 4. (English) Zbl 07312129 Linear Algebra Appl. 614, 176-196 (2021). MSC: 05C05 05C62 05C69 05C70 15A03 PDF BibTeX XML Cite \textit{D. A. Jaume} et al., Linear Algebra Appl. 614, 176--196 (2021; Zbl 07312129) Full Text: DOI
Grzesik, Andrzej; Klimošová, Tereza; Pilipczuk, Marcin; Pilipczuk, Michał Covering minimal separators and potential maximal cliques in \(P_t\)-free graphs. (English) Zbl 07310930 Electron. J. Comb. 28, No. 1, Research Paper P1.29, 14 p. (2021). MSC: 05C69 05C70 05C75 05C85 68R10 PDF BibTeX XML Cite \textit{A. Grzesik} et al., Electron. J. Comb. 28, No. 1, Research Paper P1.29, 14 p. (2021; Zbl 07310930) Full Text: DOI
Giannopoulou, Archontia; Pilipczuk, Michał; Raymond, Jean-Florent; Thilikos, Dimitrios M.; Wrochna, Marcin Linear kernels for edge deletion problems to immersion-closed graph classes. (English) Zbl 07310603 SIAM J. Discrete Math. 35, No. 1, 105-151 (2021). MSC: 05C70 05C75 05C83 05C85 PDF BibTeX XML Cite \textit{A. Giannopoulou} et al., SIAM J. Discrete Math. 35, No. 1, 105--151 (2021; Zbl 07310603) Full Text: DOI
Nobili, Paolo; Sassano, Antonio An \(\mathcal{O} (n^2 \log{n})\) algorithm for the weighted stable set problem in claw-free graphs. (English) Zbl 07310585 Math. Program. 186, No. 1-2 (A), 409-437 (2021). MSC: 05C69 05C85 05C70 PDF BibTeX XML Cite \textit{P. Nobili} and \textit{A. Sassano}, Math. Program. 186, No. 1--2 (A), 409--437 (2021; Zbl 07310585) Full Text: DOI
Shyu, Tay-Woei Decompositions of complete bipartite graphs and complete graphs into paths, stars, and cycles with four edges each. (English) Zbl 07308492 Discuss. Math., Graph Theory 41, No. 2, 451-468 (2021). MSC: 05C70 05C38 05C51 PDF BibTeX XML Cite \textit{T.-W. Shyu}, Discuss. Math., Graph Theory 41, No. 2, 451--468 (2021; Zbl 07308492) Full Text: DOI
Sun, Yuefang; Sheng, Bin; Jin, Zemin The minimum size of a graph with given tree connectivity. (English) Zbl 07308489 Discuss. Math., Graph Theory 41, No. 2, 409-425 (2021). Reviewer: László A. Székely (Columbia) MSC: 05C05 05C35 05C40 05C70 PDF BibTeX XML Cite \textit{Y. Sun} et al., Discuss. Math., Graph Theory 41, No. 2, 409--425 (2021; Zbl 07308489) Full Text: DOI
Hladký, Jan; Hu, Ping; Piguet, Diana Tilings in graphons. (English) Zbl 07307295 Eur. J. Comb. 93, Article ID 103284, 24 p. (2021). MSC: 05C70 05C80 05C35 PDF BibTeX XML Cite \textit{J. Hladký} et al., Eur. J. Comb. 93, Article ID 103284, 24 p. (2021; Zbl 07307295) Full Text: DOI
Harutyunyan, Ararat; Pastor, Lucas; Thomassé, Stéphan Disproving the normal graph conjecture. (English) Zbl 07305046 J. Comb. Theory, Ser. B 147, 238-251 (2021). MSC: 05C70 05C17 05C69 05C80 05D40 PDF BibTeX XML Cite \textit{A. Harutyunyan} et al., J. Comb. Theory, Ser. B 147, 238--251 (2021; Zbl 07305046) Full Text: DOI
Alspach, Brian; Jordon, Heather Corrigendum to “Cycle decompositions of \(K_n\) and \(K_n - I\)”. (English) Zbl 07304903 J. Comb. Theory, Ser. B 146, 532-533 (2021). MSC: 05C70 05C38 05B30 PDF BibTeX XML Cite \textit{B. Alspach} and \textit{H. Jordon}, J. Comb. Theory, Ser. B 146, 532--533 (2021; Zbl 07304903) Full Text: DOI
Radovanović, Marko; Trotignon, Nicolas; Vušković, Kristina The (theta, wheel)-free graphs. IV: Induced paths and cycles. (English) Zbl 07304902 J. Comb. Theory, Ser. B 146, 495-531 (2021). MSC: 05C70 05C75 68R10 PDF BibTeX XML Cite \textit{M. Radovanović} et al., J. Comb. Theory, Ser. B 146, 495--531 (2021; Zbl 07304902) Full Text: DOI
Glock, Stefan; Kühn, Daniela; Montgomery, Richard; Osthus, Deryk Decompositions into isomorphic rainbow spanning trees. (English) Zbl 07304900 J. Comb. Theory, Ser. B 146, 439-484 (2021). MSC: 05C70 05C05 05C15 05C60 PDF BibTeX XML Cite \textit{S. Glock} et al., J. Comb. Theory, Ser. B 146, 439--484 (2021; Zbl 07304900) Full Text: DOI
Delcourt, Michelle; Postle, Luke Progress towards Nash-Williams’ conjecture on triangle decompositions. (English) Zbl 07304898 J. Comb. Theory, Ser. B 146, 382-416 (2021). MSC: 05C70 05C35 PDF BibTeX XML Cite \textit{M. Delcourt} and \textit{L. Postle}, J. Comb. Theory, Ser. B 146, 382--416 (2021; Zbl 07304898) Full Text: DOI
DeBiasio, Louis; Gyárfás, András; Sárközy, Gábor N. Ramsey numbers of path-matchings, covering designs, and 1-cores. (English) Zbl 07304889 J. Comb. Theory, Ser. B 146, 124-140 (2021). MSC: 05C55 05D10 05C70 PDF BibTeX XML Cite \textit{L. DeBiasio} et al., J. Comb. Theory, Ser. B 146, 124--140 (2021; Zbl 07304889) Full Text: DOI
Dorpalen-Barry, Galen; Hettle, Cyrus; Livingston, David C.; Martin, Jeremy L.; Nasr, George D.; Vega, Julianne; Whitlatch, Hays A positivity phenomenon in Elser’s Gaussian-cluster percolation model. (English) Zbl 07304865 J. Comb. Theory, Ser. A 179, Article ID 105364, 28 p. (2021). MSC: 05C31 05C80 05C70 05E45 82B43 PDF BibTeX XML Cite \textit{G. Dorpalen-Barry} et al., J. Comb. Theory, Ser. A 179, Article ID 105364, 28 p. (2021; Zbl 07304865) Full Text: DOI
Kronenberg, Gal; Martins, Taísa; Morrison, Natasha Weak saturation numbers of complete bipartite graphs in the clique. (English) Zbl 07304663 J. Comb. Theory, Ser. A 178, Article ID 105357, 16 p. (2021). MSC: 05C70 05C35 PDF BibTeX XML Cite \textit{G. Kronenberg} et al., J. Comb. Theory, Ser. A 178, Article ID 105357, 16 p. (2021; Zbl 07304663) Full Text: DOI
Lintzmayer, C. N.; Mota, G. O.; Sambinelli, M. Decomposing split graphs into locally irregular graphs. (English) Zbl 07303833 Discrete Appl. Math. 292, 33-44 (2021). MSC: 05C70 PDF BibTeX XML Cite \textit{C. N. Lintzmayer} et al., Discrete Appl. Math. 292, 33--44 (2021; Zbl 07303833) Full Text: DOI
Abreu, Marién; Gauci, John Baptist; Labbate, Domenico; Mazzuoccolo, Giuseppe; Zerafa, Jean Paul Extending perfect matchings to Hamiltonian cycles in line graphs. (English) Zbl 07303530 Electron. J. Comb. 28, No. 1, Research Paper P1.7, 13 p. (2021). MSC: 05C45 05C70 05C76 PDF BibTeX XML Cite \textit{M. Abreu} et al., Electron. J. Comb. 28, No. 1, Research Paper P1.7, 13 p. (2021; Zbl 07303530) Full Text: DOI
Raz, Abigail Structure of the largest subgraphs of \(G_{n , p}\) with a given matching number. (English) Zbl 07302654 Discrete Math. 344, No. 3, Article ID 112227, 12 p. (2021). MSC: 05C80 05C70 PDF BibTeX XML Cite \textit{A. Raz}, Discrete Math. 344, No. 3, Article ID 112227, 12 p. (2021; Zbl 07302654) Full Text: DOI
Hirst, James Optimal couplings between sparse block models. (English) Zbl 07301320 Proc. Am. Math. Soc. 149, No. 1, 97-105 (2021). MSC: 05C80 05C70 PDF BibTeX XML Cite \textit{J. Hirst}, Proc. Am. Math. Soc. 149, No. 1, 97--105 (2021; Zbl 07301320) Full Text: DOI
Cho, Eun-Kyung; Choi, Ilkyoo; Park, Boram Partitioning planar graphs without 4-cycles and 5-cycles into bounded degree forests. (English) Zbl 07299431 Discrete Math. 344, No. 1, Article ID 112172, 9 p. (2021). MSC: 05C70 05C10 PDF BibTeX XML Cite \textit{E.-K. Cho} et al., Discrete Math. 344, No. 1, Article ID 112172, 9 p. (2021; Zbl 07299431) Full Text: DOI
Milich, Marcel; Mütze, Torsten; Pergel, Martin On flips in planar matchings. (English) Zbl 07289402 Discrete Appl. Math. 289, 427-445 (2021). MSC: 05C70 05C12 05C38 52A99 PDF BibTeX XML Cite \textit{M. Milich} et al., Discrete Appl. Math. 289, 427--445 (2021; Zbl 07289402) Full Text: DOI
Miklós, István; Schlafly, Geneva; Wang, Yuheng; Wei, Zhangyang Edge disjoint caterpillar realizations. (English) Zbl 07289394 Discrete Appl. Math. 289, 327-344 (2021). MSC: 05C70 05C45 05C05 05C07 05C15 05C78 05C30 PDF BibTeX XML Cite \textit{I. Miklós} et al., Discrete Appl. Math. 289, 327--344 (2021; Zbl 07289394) Full Text: DOI
Wang, Yun; Yan, Jin Packing a number of copies of a \(( p , q )\)-graph. (English) Zbl 07289391 Discrete Appl. Math. 289, 302-312 (2021). MSC: 05C70 PDF BibTeX XML Cite \textit{Y. Wang} and \textit{J. Yan}, Discrete Appl. Math. 289, 302--312 (2021; Zbl 07289391) Full Text: DOI
Javadi, Ramin; Ashkboos, Saleh Multi-way sparsest cut problem on trees with a control on the number of parts and outliers. (English) Zbl 07289389 Discrete Appl. Math. 289, 281-291 (2021). MSC: 68 05 PDF BibTeX XML Cite \textit{R. Javadi} and \textit{S. Ashkboos}, Discrete Appl. Math. 289, 281--291 (2021; Zbl 07289389) Full Text: DOI
Plachta, Leonid Coverings of cubic graphs and 3-edge colorability. (English) Zbl 1453.05106 Discuss. Math., Graph Theory 41, No. 1, 311-334 (2021). MSC: 05C70 05C15 05C10 PDF BibTeX XML Cite \textit{L. Plachta}, Discuss. Math., Graph Theory 41, No. 1, 311--334 (2021; Zbl 1453.05106) Full Text: DOI
Paulraja, P.; Srimathi, R. Decomposition of the tensor product of complete graphs into cycles of lengths 3 and 6. (English) Zbl 1453.05104 Discuss. Math., Graph Theory 41, No. 1, 249-266 (2021). MSC: 05C70 05C76 05C12 05C38 05B30 PDF BibTeX XML Cite \textit{P. Paulraja} and \textit{R. Srimathi}, Discuss. Math., Graph Theory 41, No. 1, 249--266 (2021; Zbl 1453.05104) Full Text: DOI
Klostermeyer, William F.; Messinger, Margaret-Ellen; Yeo, Anders Dominating vertex covers: the vertex-edge domination problem. (English) Zbl 07282947 Discuss. Math., Graph Theory 41, No. 1, 123-132 (2021). MSC: 05C69 05C70 PDF BibTeX XML Cite \textit{W. F. Klostermeyer} et al., Discuss. Math., Graph Theory 41, No. 1, 123--132 (2021; Zbl 07282947) Full Text: DOI
Zhang, Huihui; Li, Shuchao On the (reverse) cover cost of trees with some given parameters. (English) Zbl 1453.05122 Discrete Math. 344, No. 2, Article ID 112226, 18 p. (2021). MSC: 05C81 05C70 05C35 PDF BibTeX XML Cite \textit{H. Zhang} and \textit{S. Li}, Discrete Math. 344, No. 2, Article ID 112226, 18 p. (2021; Zbl 1453.05122) Full Text: DOI
Lu, Hongliang; Wang, Wei; Jiang, Yaolin On the complexity of all \(( g , f )\)-factors problem. (English) Zbl 1453.05103 Discrete Math. 344, No. 2, Article ID 112193, 4 p. (2021). MSC: 05C70 05C85 68Q17 PDF BibTeX XML Cite \textit{H. Lu} et al., Discrete Math. 344, No. 2, Article ID 112193, 4 p. (2021; Zbl 1453.05103) Full Text: DOI
Crespelle, Christophe; Lokshtanov, Daniel; Phan, Thi Ha Duong; Thierry, Eric Faster and enhanced inclusion-minimal cograph completion. (English) Zbl 1451.05226 Discrete Appl. Math. 288, 138-151 (2021). MSC: 05C85 05C70 68Q17 PDF BibTeX XML Cite \textit{C. Crespelle} et al., Discrete Appl. Math. 288, 138--151 (2021; Zbl 1451.05226) Full Text: DOI
Asahiro, Yuichi; Furukawa, Tetsuya; Ikegami, Keiichi; Miyano, Eiji; Yagita, Tsuyoshi How to pack directed acyclic graphs into small blocks. (English) Zbl 1451.05188 Discrete Appl. Math. 288, 91-113 (2021). MSC: 05C70 05C85 68Q17 PDF BibTeX XML Cite \textit{Y. Asahiro} et al., Discrete Appl. Math. 288, 91--113 (2021; Zbl 1451.05188) Full Text: DOI
Boreland, G.; Todorov, I. G.; Winter, A. Sandwich theorems and capacity bounds for non-commutative graphs. (English) Zbl 1448.05159 J. Comb. Theory, Ser. A 177, Article ID 105302, 39 p. (2021). MSC: 05C70 68Q25 94A24 81P45 94A40 PDF BibTeX XML Cite \textit{G. Boreland} et al., J. Comb. Theory, Ser. A 177, Article ID 105302, 39 p. (2021; Zbl 1448.05159) Full Text: DOI
Hosteins, Pierre A compact mixed integer linear formulation for safe set problems. (English) Zbl 07311809 Optim. Lett. 14, No. 8, 2127-2148 (2020). MSC: 90C PDF BibTeX XML Cite \textit{P. Hosteins}, Optim. Lett. 14, No. 8, 2127--2148 (2020; Zbl 07311809) Full Text: DOI
Ma, Huawen Maximum cuts in \(\mathscr{H} \)-free graphs. (English) Zbl 07311126 Graphs Comb. 36, No. 5, 1503-1516 (2020). MSC: 05C70 05C30 05C35 PDF BibTeX XML Cite \textit{H. Ma}, Graphs Comb. 36, No. 5, 1503--1516 (2020; Zbl 07311126) Full Text: DOI
Xie, Mengmeng; Zhou, Chuixiang Signed circuit cover of bridgeless signed graphs. (English) Zbl 07311121 Graphs Comb. 36, No. 5, 1423-1443 (2020). MSC: 05C22 05C21 05C70 05C35 05C75 PDF BibTeX XML Cite \textit{M. Xie} and \textit{C. Zhou}, Graphs Comb. 36, No. 5, 1423--1443 (2020; Zbl 07311121) Full Text: DOI
Taranenko, Anna A. Algebraic properties of perfect structures. (English) Zbl 07309728 Linear Algebra Appl. 607, 286-306 (2020). MSC: 05C50 05C76 05C70 05C15 15A18 PDF BibTeX XML Cite \textit{A. A. Taranenko}, Linear Algebra Appl. 607, 286--306 (2020; Zbl 07309728) Full Text: DOI
Priyadarsini, Shanmugasundaram; Muthusamy, Appu Decomposition of complete tripartite graphs into cycles and paths of length three. (English) Zbl 07309086 Contrib. Discrete Math. 15, No. 3, 117-129 (2020). MSC: 05C70 05C38 PDF BibTeX XML Cite \textit{S. Priyadarsini} and \textit{A. Muthusamy}, Contrib. Discrete Math. 15, No. 3, 117--129 (2020; Zbl 07309086) Full Text: DOI
Banaian, Esther; Kelley, Elizabeth Snake graphs from triangulated orbifolds. (English) Zbl 07302823 SIGMA, Symmetry Integrability Geom. Methods Appl. 16, Paper 138, 50 p. (2020). MSC: 05E14 13F60 05C70 16S99 PDF BibTeX XML Cite \textit{E. Banaian} and \textit{E. Kelley}, SIGMA, Symmetry Integrability Geom. Methods Appl. 16, Paper 138, 50 p. (2020; Zbl 07302823) Full Text: DOI
Khalaf, Abdul Jalil M.; Naeem, Muhammad; Siddiqui, Muhammad Kamran; Baig, Abdul Qudair Super antimagic total labeling under duplication operations. (English) Zbl 1452.05162 Proyecciones 39, No. 4, 995-1003 (2020). MSC: 05C78 05C70 05C75 PDF BibTeX XML Cite \textit{A. J. M. Khalaf} et al., Proyecciones 39, No. 4, 995--1003 (2020; Zbl 1452.05162) Full Text: DOI
Recalde, Diego; Torres, Ramiro; Vaca, Polo An exact approach for the multi-constraint graph partitioning problem. (English) Zbl 1452.90225 EURO J. Comput. Optim. 8, No. 3-4, 289-308 (2020). MSC: 90C10 90C27 90C57 05C70 PDF BibTeX XML Cite \textit{D. Recalde} et al., EURO J. Comput. Optim. 8, No. 3--4, 289--308 (2020; Zbl 1452.90225) Full Text: DOI
Chaluvaraju, B.; Chaitra, V. Restricted minus domination number of a graph. (English) Zbl 07296955 South East Asian J. Math. Math. Sci. 16, No. 2, 289-296 (2020). MSC: 05C69 05C70 PDF BibTeX XML Cite \textit{B. Chaluvaraju} and \textit{V. Chaitra}, South East Asian J. Math. Math. Sci. 16, No. 2, 289--296 (2020; Zbl 07296955) Full Text: Link
Zhou, Zhongwang Signed star domination numbers and factors of graphs. (Chinese. English summary) Zbl 07296013 Math. Pract. Theory 50, No. 10, 291-295 (2020). MSC: 05C69 05C70 PDF BibTeX XML Cite \textit{Z. Zhou}, Math. Pract. Theory 50, No. 10, 291--295 (2020; Zbl 07296013)
Ma, Haicheng; Li, Danyang The largest root of matching polynomials of a class of bicyclic graphs. (Chinese. English summary) Zbl 07295282 J. Guangzhou Univ., Nat. Sci. 19, No. 1, 72-77 (2020). MSC: 05C31 05C35 05C70 PDF BibTeX XML Cite \textit{H. Ma} and \textit{D. Li}, J. Guangzhou Univ., Nat. Sci. 19, No. 1, 72--77 (2020; Zbl 07295282)
Tang, Baoxiang; Ren, Han Enumeration of perfect matchings of a type of 3-regular graphs. (Chinese. English summary) Zbl 07295222 J. Dalian Univ. Technol. 60, No. 4, 437-440 (2020). MSC: 05C30 05C70 PDF BibTeX XML Cite \textit{B. Tang} and \textit{H. Ren}, J. Dalian Univ. Technol. 60, No. 4, 437--440 (2020; Zbl 07295222) Full Text: DOI
Wang, Yan; Zhou, Jinqiu Cubic graphs with 3-edge coloring of graphs. (English) Zbl 07294964 Adv. Math., Beijing 49, No. 4, 413-417 (2020). MSC: 05C15 05C70 PDF BibTeX XML Cite \textit{Y. Wang} and \textit{J. Zhou}, Adv. Math., Beijing 49, No. 4, 413--417 (2020; Zbl 07294964) Full Text: DOI
Zisler, Matthias; Zern, Artjom; Petra, Stefania; Schnörr, Christoph Self-assignment flows for unsupervised data labeling on graphs. (English) Zbl 07292220 SIAM J. Imaging Sci. 13, No. 3, 1113-1156 (2020). MSC: 62H35 62H30 62M45 68T05 91A22 PDF BibTeX XML Cite \textit{M. Zisler} et al., SIAM J. Imaging Sci. 13, No. 3, 1113--1156 (2020; Zbl 07292220) Full Text: DOI
Mojdeh, Doost Ali; Peterin, Iztok; Samadi, Babak; Yero, Ismael G. (Open) packing number of some graph products. (English) Zbl 07290416 Discrete Math. Theor. Comput. Sci. 22, No. 4, Paper No. 1, 17 p. (2020). Reviewer: Isabel Beckenbach (Berlin) MSC: 05C70 05C76 PDF BibTeX XML Cite \textit{D. A. Mojdeh} et al., Discrete Math. Theor. Comput. Sci. 22, No. 4, Paper No. 1, 17 p. (2020; Zbl 07290416) Full Text: Link
Lu, Hongliang; Wang, Wei; Yan, Juan Antifactors of regular bipartite graphs. (English) Zbl 07290408 Discrete Math. Theor. Comput. Sci. 22, No. 1, Paper No. 16, 9 p. (2020). MSC: 05C70 PDF BibTeX XML Cite \textit{H. Lu} et al., Discrete Math. Theor. Comput. Sci. 22, No. 1, Paper No. 16, 9 p. (2020; Zbl 07290408) Full Text: DOI
Kamčev, Nina; Krivelevich, Michael; Morrison, Natasha; Sudakov, Benny The Kőnig graph process. (English) Zbl 07290208 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 07290208) Full Text: DOI
Salindeho, Brilly Maxel; Assiyatun, Hilda; Baskoro, Edy Tri On the locating-chromatic numbers of subdivisions of friendship graph. (English) Zbl 1451.05086 J. Indones. Math. Soc. 26, No. 2, 175-184 (2020). MSC: 05C15 05C70 PDF BibTeX XML Cite \textit{B. M. Salindeho} et al., J. Indones. Math. Soc. 26, No. 2, 175--184 (2020; Zbl 1451.05086) Full Text: DOI
Groenland, Koen; Groenland, Carla; Kramer, Reinier Stimulated Raman adiabatic passage-like protocols for amplitude transfer generalize to many bipartite graphs. (English) Zbl 07287162 J. Math. Phys. 61, No. 7, 072201, 14 p. (2020). MSC: 81P47 81P45 05C70 05C82 05C05 81P68 PDF BibTeX XML Cite \textit{K. Groenland} et al., J. Math. Phys. 61, No. 7, 072201, 14 p. (2020; Zbl 07287162) Full Text: DOI
Montgomery, Richard; Pokrovskiy, Alexey; Sudakov, Benny Embedding rainbow trees with applications to graph labelling and decomposition. (English) Zbl 07286828 J. Eur. Math. Soc. (JEMS) 22, No. 10, 3101-3132 (2020). MSC: 05C05 05C70 05C15 05D40 05C35 05C78 PDF BibTeX XML Cite \textit{R. Montgomery} et al., J. Eur. Math. Soc. (JEMS) 22, No. 10, 3101--3132 (2020; Zbl 07286828) Full Text: DOI
Goddard, Wayne; Kuenzel, Kirsti; Melville, Eileen Graphs in which all maximal bipartite subgraphs have the same order. (English) Zbl 07286383 Aequationes Math. 94, No. 6, 1241-1255 (2020). Reviewer: Vahan Mkrtchyan (L’Aquila) MSC: 05C70 05C76 05C69 PDF BibTeX XML Cite \textit{W. Goddard} et al., Aequationes Math. 94, No. 6, 1241--1255 (2020; Zbl 07286383) Full Text: DOI
Borg, Peter; Fenech, Kurt A Turán-type generalization of Tuza’s triangle edge cover problem. (English) Zbl 1453.05096 Australas. J. Comb. 78, Part 3, 399-412 (2020). MSC: 05C70 05C30 PDF BibTeX XML Cite \textit{P. Borg} and \textit{K. Fenech}, Australas. J. Comb. 78, Part 3, 399--412 (2020; Zbl 1453.05096) Full Text: Link
Chan, Tsz Lung Contractible edges in subgraphs of \(2\)-connected graphs. (English) Zbl 1453.05097 Australas. J. Comb. 78, Part 2, 191-208 (2020). MSC: 05C70 05C35 05C40 05C05 05C38 05C12 PDF BibTeX XML Cite \textit{T. L. Chan}, Australas. J. Comb. 78, Part 2, 191--208 (2020; Zbl 1453.05097) Full Text: Link
Domagalski, Rachel; Narayan, Sivaram K. Tree cover number and maximum semidefinite nullity of some graph classes. (English) Zbl 1453.05099 Electron. J. Linear Algebra 36, 678-693 (2020). MSC: 05C70 05C76 15A03 15A18 PDF BibTeX XML Cite \textit{R. Domagalski} and \textit{S. K. Narayan}, Electron. J. Linear Algebra 36, 678--693 (2020; Zbl 1453.05099) Full Text: Link
Adachi, Tomoko Some new results on cluttered ordering on several special bipartite graphs. (English) Zbl 1448.05157 Shum, K. P. (ed.) et al., New trends in algebras and combinatorics. Proceedings of the 3rd international congress in algebras and combinatorics, ICAC 2017, Hong Kong, China, August 25–28, 2017. In honor of Professor Leonid Bokut on the occasion of his 80th birthday. Hackensack, NJ: World Scientific. 23-33 (2020). MSC: 05C70 05C78 PDF BibTeX XML Cite \textit{T. Adachi}, in: New trends in algebras and combinatorics. Proceedings of the 3rd international congress in algebras and combinatorics, ICAC 2017, Hong Kong, China, August 25--28, 2017. In honor of Professor Leonid Bokut on the occasion of his 80th birthday. Hackensack, NJ: World Scientific. 23--33 (2020; Zbl 1448.05157) Full Text: DOI
Carmesin, Johannes; Georgakopoulos, Agelos Every planar graph with the Liouville property is amenable. (English) Zbl 1453.31015 Random Struct. Algorithms 57, No. 3, 706-729 (2020). MSC: 31C20 05C70 PDF BibTeX XML Cite \textit{J. Carmesin} and \textit{A. Georgakopoulos}, Random Struct. Algorithms 57, No. 3, 706--729 (2020; Zbl 1453.31015) Full Text: DOI
Mossel, Elchanan; Xu, Jiaming Seeded graph matching via large neighborhood statistics. (English) Zbl 1453.05073 Random Struct. Algorithms 57, No. 3, 570-611 (2020). MSC: 05C60 05C70 05C42 PDF BibTeX XML Cite \textit{E. Mossel} and \textit{J. Xu}, Random Struct. Algorithms 57, No. 3, 570--611 (2020; Zbl 1453.05073) Full Text: DOI
Ferber, Asaf; Jain, Vishesh 1-factorizations of pseudorandom graphs. (English) Zbl 1453.05100 Random Struct. Algorithms 57, No. 2, 259-278 (2020). MSC: 05C70 05C80 05C15 PDF BibTeX XML Cite \textit{A. Ferber} and \textit{V. Jain}, Random Struct. Algorithms 57, No. 2, 259--278 (2020; Zbl 1453.05100) Full Text: DOI
Staden, Katherine; Treglown, Andrew The bandwidth theorem for locally dense graphs. (English) Zbl 1452.05142 Forum Math. Sigma 8, Paper No. e42, 36 p. (2020). MSC: 05C70 05C45 05C42 05C60 PDF BibTeX XML Cite \textit{K. Staden} and \textit{A. Treglown}, Forum Math. Sigma 8, Paper No. e42, 36 p. (2020; Zbl 1452.05142) Full Text: DOI
Ehard, Stefan; Glock, Stefan; Joos, Felix A rainbow blow-up lemma for almost optimally bounded edge-colourings. (English) Zbl 07276273 Forum Math. Sigma 8, Paper No. e37, 32 p. (2020). MSC: 05C15 05C35 05C51 05C60 05C70 05C78 05B40 PDF BibTeX XML Cite \textit{S. Ehard} et al., Forum Math. Sigma 8, Paper No. e37, 32 p. (2020; Zbl 07276273) Full Text: DOI
Ahmad, Uzma; Hameed, Saira; Jabeen, Shaista Class of weighted graphs with strong anti-reciprocal eigenvalue property. (English) Zbl 1452.05100 Linear Multilinear Algebra 68, No. 6, 1129-1139 (2020). MSC: 05C50 05C22 05C70 15A18 PDF BibTeX XML Cite \textit{U. Ahmad} et al., Linear Multilinear Algebra 68, No. 6, 1129--1139 (2020; Zbl 1452.05100) Full Text: DOI
Guo, Zhiwei; Zhao, Haixing; Mao, Yaping Linear \(k\)-arboricity of complete bipartite graphs. (English) Zbl 07274239 Util. Math. 114, 295-308 (2020). Reviewer: V. Yegnanarayanan (Chennai) MSC: 05C70 05C38 05C12 05C51 PDF BibTeX XML Cite \textit{Z. Guo} et al., Util. Math. 114, 295--308 (2020; Zbl 07274239)
McKee, Terry A. Uncrossed chords of cycles in chordal graphs. (English) Zbl 1452.05152 Util. Math. 114, 277-281 (2020). MSC: 05C75 05C38 05C70 PDF BibTeX XML Cite \textit{T. A. McKee}, Util. Math. 114, 277--281 (2020; Zbl 1452.05152)
Jiang, Jiashang A sufficient condition for fractional ID-\([a,b]\)-factor-critical covered graphs. (English) Zbl 1452.05139 Util. Math. 114, 173-179 (2020). MSC: 05C70 PDF BibTeX XML Cite \textit{J. Jiang}, Util. Math. 114, 173--179 (2020; Zbl 1452.05139)
Zhou, Sizhong; Sun, Zhiren Isolated toughness and \(P_{\ge 3}\)-factors in graphs. (English) Zbl 1452.05144 Util. Math. 114, 115-125 (2020). MSC: 05C70 05C38 90B10 PDF BibTeX XML Cite \textit{S. Zhou} and \textit{Z. Sun}, Util. Math. 114, 115--125 (2020; Zbl 1452.05144)
Su, Guifu; Yan, Jingru; Chen, Zhibing; Rao, Gang Some extremal graphs with respect to the zeroth-order general Randić index. (English) Zbl 1452.05092 Util. Math. 114, 73-98 (2020). MSC: 05C35 05C09 05C69 05C70 PDF BibTeX XML Cite \textit{G. Su} et al., Util. Math. 114, 73--98 (2020; Zbl 1452.05092)
Wang, S.; Zhang, W. Research on fractional critical covered graphs. (English. Russian original) Zbl 07273676 Probl. Inf. Transm. 56, No. 3, 270-277 (2020); translation from Probl. Peredachi Inf. 56, No. 5, 77-85 (2020). MSC: 05C70 05C72 PDF BibTeX XML Cite \textit{S. Wang} and \textit{W. Zhang}, Probl. Inf. Transm. 56, No. 3, 270--277 (2020; Zbl 07273676); translation from Probl. Peredachi Inf. 56, No. 5, 77--85 (2020) Full Text: DOI
Davis, Timothy A.; Hager, William W.; Kolodziej, Scott P.; Yeralan, S. Nuri Algorithm 1003: Mongoose, a graph coarsening and partitioning library. (English) Zbl 07272238 ACM Trans. Math. Softw. 46, No. 1, Article No. 7, 18 p. (2020). MSC: 65 PDF BibTeX XML Cite \textit{T. A. Davis} et al., ACM Trans. Math. Softw. 46, No. 1, Article No. 7, 18 p. (2020; Zbl 07272238) Full Text: DOI
Chen, Jing; Tang, Lang The commuting graphs on dicyclic groups. (English) Zbl 1451.05104 Algebra Colloq. 27, No. 4, 799-806 (2020). MSC: 05C25 05C70 05C12 05C69 PDF BibTeX XML Cite \textit{J. Chen} and \textit{L. Tang}, Algebra Colloq. 27, No. 4, 799--806 (2020; Zbl 1451.05104) Full Text: DOI
Azad, Ariful; Buluç, Aydin; Li, Xiaoye S.; Wang, Xinliang; Langguth, Johannes A distributed-memory algorithm for computing a heavy-weight perfect matching on bipartite graphs. (English) Zbl 1451.05189 SIAM J. Sci. Comput. 42, No. 4, C143-C168 (2020). MSC: 05C70 05C85 05C22 68W10 05D15 68W25 PDF BibTeX XML Cite \textit{A. Azad} et al., SIAM J. Sci. Comput. 42, No. 4, C143--C168 (2020; Zbl 1451.05189) Full Text: DOI
Buzatu, Radu On the computational complexity of optimization convex covering problems of graphs. (English) Zbl 1445.68107 Comput. Sci. J. Mold. 28, No. 2, 187-200 (2020). MSC: 68Q25 05C70 68Q17 68R10 PDF BibTeX XML Cite \textit{R. Buzatu}, Comput. Sci. J. Mold. 28, No. 2, 187--200 (2020; Zbl 1445.68107) Full Text: Link
Avin, Chen; Bienkowski, Marcin; Loukas, Andreas; Pacut, Maciej; Schmid, Stefan Dynamic balanced graph partitioning. (English) Zbl 07267908 SIAM J. Discrete Math. 34, No. 3, 1791-1812 (2020). MSC: 68R10 68W05 68W40 68Q25 PDF BibTeX XML Cite \textit{C. Avin} et al., SIAM J. Discrete Math. 34, No. 3, 1791--1812 (2020; Zbl 07267908) Full Text: DOI
De Carvalho, Marcelo H.; Kothari, Nishad; Wang, Xiumei; Lin, Yixun Birkhoff-von Neumann graphs that are PM-compact. (English) Zbl 1450.05068 SIAM J. Discrete Math. 34, No. 3, 1769-1790 (2020). MSC: 05C70 05C75 90C27 PDF BibTeX XML Cite \textit{M. H. De Carvalho} et al., SIAM J. Discrete Math. 34, No. 3, 1769--1790 (2020; Zbl 1450.05068) Full Text: DOI
Cranston, Daniel W.; Yancey, Matthew P. Sparse graphs are near-bipartite. (English) Zbl 1450.05025 SIAM J. Discrete Math. 34, No. 3, 1725-1768 (2020). MSC: 05C15 05C42 05C70 05C75 PDF BibTeX XML Cite \textit{D. W. Cranston} and \textit{M. P. Yancey}, SIAM J. Discrete Math. 34, No. 3, 1725--1768 (2020; Zbl 1450.05025) Full Text: DOI
van Batenburg, Wouter Cames; Joret, Gwenaël; Ulmer, Arthur Erdős-Pósa from ball packing. (English) Zbl 1450.05045 SIAM J. Discrete Math. 34, No. 3, 1609-1619 (2020). MSC: 05C38 05C12 05C70 05C83 PDF BibTeX XML Cite \textit{W. C. van Batenburg} et al., SIAM J. Discrete Math. 34, No. 3, 1609--1619 (2020; Zbl 1450.05045) Full Text: DOI
Tian, Zhifang; Liu, Fengxia Partitioning the Cartesian product of a star-like tree and a path. (English) Zbl 07266395 Adv. Math., Beijing 49, No. 3, 305-312 (2020). MSC: 05C05 05C38 05C70 05C76 PDF BibTeX XML Cite \textit{Z. Tian} and \textit{F. Liu}, Adv. Math., Beijing 49, No. 3, 305--312 (2020; Zbl 07266395) Full Text: DOI
Spink, Hunter; Tiba, Marius Judiciously 3-partitioning 3-uniform hypergraphs. (English) Zbl 1450.05062 Random Struct. Algorithms 56, No. 4, 1205-1221 (2020). MSC: 05C65 05C35 05C70 PDF BibTeX XML Cite \textit{H. Spink} and \textit{M. Tiba}, Random Struct. Algorithms 56, No. 4, 1205--1221 (2020; Zbl 1450.05062) Full Text: DOI
Kim, Jaehoon; Kühn, Daniela; Kupavskii, Andrey; Osthus, Deryk Rainbow structures in locally bounded colorings of graphs. (English) Zbl 1450.05070 Random Struct. Algorithms 56, No. 4, 1171-1204 (2020). MSC: 05C70 05C15 05C05 05C45 05B15 05C80 PDF BibTeX XML Cite \textit{J. Kim} et al., Random Struct. Algorithms 56, No. 4, 1171--1204 (2020; Zbl 1450.05070) Full Text: DOI
Gorgi, Abbass; El Ouali, Mourad; Srivastav, Anand; Hachimi, Mohamed Approximation of set multi-cover via hypergraph matching. (English) Zbl 07264850 Theor. Comput. Sci. 845, 136-143 (2020). MSC: 68R10 05C65 05C70 05C85 68Q17 68W25 68W40 PDF BibTeX XML Cite \textit{A. Gorgi} et al., Theor. Comput. Sci. 845, 136--143 (2020; Zbl 07264850) Full Text: DOI
Mukhopadhyay, Subhadeep; Wang, Kaijun A nonparametric approach to high-dimensional \(k\)-sample comparison problems. (English) Zbl 1451.62065 Biometrika 107, No. 3, 555-572 (2020). MSC: 62H22 62G05 PDF BibTeX XML Cite \textit{S. Mukhopadhyay} and \textit{K. Wang}, Biometrika 107, No. 3, 555--572 (2020; Zbl 1451.62065) Full Text: DOI
Yuster, Raphael Covering small subgraphs of (hyper)tournaments with spanning acyclic subgraphs. (English) Zbl 1450.05071 Electron. J. Comb. 27, No. 4, Research Paper P4.13, 15 p. (2020). MSC: 05C70 05C20 05C35 PDF BibTeX XML Cite \textit{R. Yuster}, Electron. J. Comb. 27, No. 4, Research Paper P4.13, 15 p. (2020; Zbl 1450.05071) Full Text: DOI
Young, Donovan Linear \(k\)-chord diagrams. (English) Zbl 1448.05008 J. Integer Seq. 23, No. 9, Article 20.9.1, 22 p. (2020). MSC: 05A15 05C70 60C05 05C30 PDF BibTeX XML Cite \textit{D. Young}, J. Integer Seq. 23, No. 9, Article 20.9.1, 22 p. (2020; Zbl 1448.05008) Full Text: Link
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
Haraguchi, Kazuya; Torii, Kotaro; Endo, Motomu Maximum weighted matching with few edge crossings for 2-layered bipartite graph. (English) Zbl 1448.05097 Discrete Appl. Math. 287, 40-52 (2020). MSC: 05C22 05C35 05C70 05C85 PDF BibTeX XML Cite \textit{K. Haraguchi} et al., Discrete Appl. Math. 287, 40--52 (2020; Zbl 1448.05097) Full Text: DOI
Vafaei, Morteza; Tehranian, Abolfazl; Nikandish, Reza A class of well-covered and vertex decomposable graphs arising from rings. (English) Zbl 07260095 Algebr. Struct. Appl. 7, No. 2, 79-91 (2020). MSC: 05C70 05C25 05C69 PDF BibTeX XML Cite \textit{M. Vafaei} et al., Algebr. Struct. Appl. 7, No. 2, 79--91 (2020; Zbl 07260095) Full Text: DOI
Zhang, An; Chen, Yong; Chen, Zhi-Zhong; Lin, Guohui Improved approximation algorithms for path vertex covers in regular graphs. (English) Zbl 07259203 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 07259203) Full Text: DOI
Majumdar, Diptapriyo; Ramanujan, M. S.; Saurabh, Saket On the approximate compressibility of connected vertex cover. (English) Zbl 07259198 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 07259198) Full Text: DOI
Grytczuk, Jarosław; Zhu, Xuding The Alon-Tarsi number of a planar graph minus a matching. (English) Zbl 1448.05050 J. Comb. Theory, Ser. B 145, 511-520 (2020). MSC: 05C10 05C70 05C15 PDF BibTeX XML Cite \textit{J. Grytczuk} and \textit{X. Zhu}, J. Comb. Theory, Ser. B 145, 511--520 (2020; Zbl 1448.05050) Full Text: DOI
Grout, Logan; Moore, Benjamin The pseudoforest analogue for the strong nine dragon tree conjecture is true. (English) Zbl 1448.05163 J. Comb. Theory, Ser. B 145, 433-449 (2020). MSC: 05C70 05C05 05C07 PDF BibTeX XML Cite \textit{L. Grout} and \textit{B. Moore}, J. Comb. Theory, Ser. B 145, 433--449 (2020; Zbl 1448.05163) Full Text: DOI
Glazyrin, Alexey Contact graphs of ball packings. (English) Zbl 1448.05162 J. Comb. Theory, Ser. B 145, 323-340 (2020). MSC: 05C70 05C62 52C17 PDF BibTeX XML Cite \textit{A. Glazyrin}, J. Comb. Theory, Ser. B 145, 323--340 (2020; Zbl 1448.05162) Full Text: DOI
Cameron, Rosalind A.; Horsley, Daniel Decompositions of complete multigraphs into stars of varying sizes. (English) Zbl 1448.05160 J. Comb. Theory, Ser. B 145, 32-64 (2020). Reviewer: William G. Brown (Montréal) MSC: 05C70 05C20 05C85 68Q17 PDF BibTeX XML Cite \textit{R. A. Cameron} and \textit{D. Horsley}, J. Comb. Theory, Ser. B 145, 32--64 (2020; Zbl 1448.05160) Full Text: DOI
Zheng, Shasha; Liu, Xiaogang; Zhang, Shenggui Perfect state transfer in NEPS of some graphs. (English) Zbl 1448.05136 Linear Multilinear Algebra 68, No. 8, 1518-1533 (2020). MSC: 05C50 05C70 81P68 15A18 PDF BibTeX XML Cite \textit{S. Zheng} et al., Linear Multilinear Algebra 68, No. 8, 1518--1533 (2020; Zbl 1448.05136) Full Text: DOI
Chaiyasena, Arjuna; Pabhapote, Nittiya GDDs with two associate classes and with three groups of sizes \(3,n\) and \(n\). (English) Zbl 1448.05021 East-West J. Math. 22, No. 1, 86-94 (2020). MSC: 05B05 05B07 05C70 PDF BibTeX XML Cite \textit{A. Chaiyasena} and \textit{N. Pabhapote}, East-West J. Math. 22, No. 1, 86--94 (2020; Zbl 1448.05021) Full Text: DOI Link
Ekström, Henrik The phases of a discrete flow of particles on graphs. (English) Zbl 1451.05096 Markov Process. Relat. Fields 26, No. 2, 343-364 (2020). MSC: 05C21 05C90 PDF BibTeX XML Cite \textit{H. Ekström}, Markov Process. Relat. Fields 26, No. 2, 343--364 (2020; Zbl 1451.05096) Full Text: Link
Zhou, Sizhong; Zhang, Tao; Xu, Zurun Subgraphs with orthogonal factorizations in graphs. (English) Zbl 1448.05166 Discrete Appl. Math. 286, 29-34 (2020). MSC: 05C70 05C60 PDF BibTeX XML Cite \textit{S. Zhou} et al., Discrete Appl. Math. 286, 29--34 (2020; Zbl 1448.05166) Full Text: DOI
Kim, Jaehoon; Kim, Younjin; Liu, Hong Tree decompositions of graphs without large bipartite holes. (English) Zbl 1453.05102 Random Struct. Algorithms 57, No. 1, 150-168 (2020). Reviewer: Isabel Beckenbach (Berlin) MSC: 05C70 05C35 05C80 PDF BibTeX XML Cite \textit{J. Kim} et al., Random Struct. Algorithms 57, No. 1, 150--168 (2020; Zbl 1453.05102) Full Text: DOI
Barber, Ben; Glock, Stefan; Kühn, Daniela; Lo, Allan; Montgomery, Richard; Osthus, Deryk Minimalist designs. (English) Zbl 1451.05159 Random Struct. Algorithms 57, No. 1, 47-63 (2020). MSC: 05C65 05C70 05C35 05C51 PDF BibTeX XML Cite \textit{B. Barber} et al., Random Struct. Algorithms 57, No. 1, 47--63 (2020; Zbl 1451.05159) Full Text: DOI
Zhou, Si Zhong; Sun, Zhi Ren Some existence theorems on path factors with given properties in graphs. (English) Zbl 1447.05177 Acta Math. Sin., Engl. Ser. 36, No. 8, 917-928 (2020). MSC: 05C70 05C38 90B10 PDF BibTeX XML Cite \textit{S. Z. Zhou} and \textit{Z. R. Sun}, Acta Math. Sin., Engl. Ser. 36, No. 8, 917--928 (2020; Zbl 1447.05177) Full Text: DOI