Barát, János; Blázsik, Zoltán L. Quest for graphs of Frank number 3. (English) Zbl 07790327 Australas. J. Comb. 88, Part 1, 52-76 (2024). MSC: 05C40 PDFBibTeX XMLCite \textit{J. Barát} and \textit{Z. L. Blázsik}, Australas. J. Comb. 88, Part 1, 52--76 (2024; Zbl 07790327) Full Text: arXiv Link
Fu, Lingting; Gao, Liqing; Wang, Jian; Yang, Weihua Non-Hamiltonian graphs with large minimum degree. (English) Zbl 07788967 Bull. Malays. Math. Sci. Soc. (2) 47, No. 1, Paper No. 32, 11 p. (2024). MSC: 05C40 05C45 PDFBibTeX XMLCite \textit{L. Fu} et al., Bull. Malays. Math. Sci. Soc. (2) 47, No. 1, Paper No. 32, 11 p. (2024; Zbl 07788967) Full Text: DOI
Ibiapina, Allen; Silva, Ana Mengerian graphs: characterization and recognition. (English) Zbl 07753724 J. Comput. Syst. Sci. 139, Article ID 103467, 20 p. (2024). MSC: 68-XX PDFBibTeX XMLCite \textit{A. Ibiapina} and \textit{A. Silva}, J. Comput. Syst. Sci. 139, Article ID 103467, 20 p. (2024; Zbl 07753724) Full Text: DOI arXiv
Chen, Xiaofeng Synchronization of heterogeneous harmonic oscillators for generalized uniformly jointly connected networks. (English) Zbl 07804380 Electron. Res. Arch. 31, No. 8, 5039-5055 (2023). MSC: 93D99 93B70 PDFBibTeX XMLCite \textit{X. Chen}, Electron. Res. Arch. 31, No. 8, 5039--5055 (2023; Zbl 07804380) Full Text: DOI
Ito, Takehiro; Iwamasa, Yuni; Kakimura, Naonori; Kamiyama, Naoyuki; Kobayashi, Yusuke; Maezawa, Shun-Ichi; Nozaki, Yuta; Okamoto, Yoshio; Ozeki, Kenta Monotone edge flips to an orientation of maximum edge-connectivity à la Nash-Williams. (English) Zbl 07753157 ACM Trans. Algorithms 19, No. 1, Article No. 6, 22 p. (2023). MSC: 68-XX PDFBibTeX XMLCite \textit{T. Ito} et al., ACM Trans. Algorithms 19, No. 1, Article No. 6, 22 p. (2023; Zbl 07753157) Full Text: DOI arXiv
Fredes, Luis; Marckert, Jean-François A combinatorial proof of Aldous-Broder theorem for general Markov chains. (English) Zbl 1522.05426 Random Struct. Algorithms 62, No. 2, 430-449 (2023). MSC: 05C80 05C05 05C40 05C81 60J10 PDFBibTeX XMLCite \textit{L. Fredes} and \textit{J.-F. Marckert}, Random Struct. Algorithms 62, No. 2, 430--449 (2023; Zbl 1522.05426) Full Text: DOI arXiv
Jacobs, Raphael W.; Joó, Attila; Knappe, Paul; Kurkofka, Jan; Melcher, Ruben The Lovász-Cherkassky theorem for locally finite graphs with ends. (English) Zbl 1522.05209 Discrete Math. 346, No. 12, Article ID 113586, 6 p. (2023). MSC: 05C30 05C38 05C35 57M15 05C40 90B10 PDFBibTeX XMLCite \textit{R. W. Jacobs} et al., Discrete Math. 346, No. 12, Article ID 113586, 6 p. (2023; Zbl 1522.05209) Full Text: DOI arXiv
Corsini, Timothée; Deschamps, Quentin; Feghali, Carl; Gonçalves, Daniel; Langlois, Hélène; Talon, Alexandre Partitioning into degenerate graphs in linear time. (English) Zbl 1525.05154 Eur. J. Comb. 114, Article ID 103771, 12 p. (2023). MSC: 05C70 05C40 05C07 05C35 68Q25 PDFBibTeX XMLCite \textit{T. Corsini} et al., Eur. J. Comb. 114, Article ID 103771, 12 p. (2023; Zbl 1525.05154) Full Text: DOI arXiv
Georgakopoulos, Agelos; Kim, Jaehoon 2-complexes with unique embeddings in 3-space. (English) Zbl 1519.05059 Bull. Lond. Math. Soc. 55, No. 1, 156-174 (2023). MSC: 05C10 05C40 57M15 57M99 57N35 54C25 PDFBibTeX XMLCite \textit{A. Georgakopoulos} and \textit{J. Kim}, Bull. Lond. Math. Soc. 55, No. 1, 156--174 (2023; Zbl 1519.05059) Full Text: DOI arXiv
Lee, Duksang; Oum, Sang-il A chain theorem for sequentially 3-rank-connected graphs with respect to vertex-minors. (English) Zbl 1519.05139 Eur. J. Comb. 113, Article ID 103761, 20 p. (2023). MSC: 05C40 05C83 PDFBibTeX XMLCite \textit{D. Lee} and \textit{S.-i. Oum}, Eur. J. Comb. 113, Article ID 103761, 20 p. (2023; Zbl 1519.05139) Full Text: DOI arXiv
Costa E. Silva, Ivan Pontual; Flores, José Luis; Ribeiro Honorato, Kledilson Peter Path-lifting properties of the exponential map with applications to geodesics. (English) Zbl 1519.53030 Rev. Mat. Iberoam. 39, No. 4, 1493-1517 (2023). MSC: 53C22 53C50 PDFBibTeX XMLCite \textit{I. P. Costa E. Silva} et al., Rev. Mat. Iberoam. 39, No. 4, 1493--1517 (2023; Zbl 1519.53030) Full Text: DOI
Suresh Singh, G.; Chandran, Athira An extended study of \(k\)-restricted edge connectivity: another approach to Tait’s coloring theorem. (English) Zbl 1516.05072 Discrete Math. Algorithms Appl. 15, No. 3, Article ID 2250089, 13 p. (2023). MSC: 05C15 05C40 PDFBibTeX XMLCite \textit{G. Suresh Singh} and \textit{A. Chandran}, Discrete Math. Algorithms Appl. 15, No. 3, Article ID 2250089, 13 p. (2023; Zbl 1516.05072) Full Text: DOI
El Joubbeh, Mouhamad Minimum separators and Menger’s theorem. (English) Zbl 1518.05094 Graphs Comb. 39, No. 3, Paper No. 61, 5 p. (2023). MSC: 05C40 05C38 05C30 PDFBibTeX XMLCite \textit{M. El Joubbeh}, Graphs Comb. 39, No. 3, Paper No. 61, 5 p. (2023; Zbl 1518.05094) Full Text: DOI
Costalonga, J. P.; Reid, T. J.; Wu, H. Rooted prism-minors and disjoint cycles containing a specified edge. (English) Zbl 1516.05112 Electron. J. Comb. 30, No. 2, Research Paper P2.38, 33 p. (2023). MSC: 05C40 05C75 05C83 PDFBibTeX XMLCite \textit{J. P. Costalonga} et al., Electron. J. Comb. 30, No. 2, Research Paper P2.38, 33 p. (2023; Zbl 1516.05112) Full Text: DOI arXiv
Gartside, Paul; Mamatelashvili, Ana; Pitz, Max \(n\)-arc connected graphs. (English) Zbl 1502.05120 Colloq. Math. 171, No. 1, 19-47 (2023). MSC: 05C45 05C38 05C40 05C63 PDFBibTeX XMLCite \textit{P. Gartside} et al., Colloq. Math. 171, No. 1, 19--47 (2023; Zbl 1502.05120) Full Text: DOI arXiv
Hayashi, Koyo; Kawarabayashi, Ken-ichi Rooted topological minors on four vertices. (English) Zbl 1504.05272 J. Comb. Theory, Ser. B 158, Part 1, 146-185 (2023). MSC: 05C83 05C78 05C40 PDFBibTeX XMLCite \textit{K. Hayashi} and \textit{K.-i. Kawarabayashi}, J. Comb. Theory, Ser. B 158, Part 1, 146--185 (2023; Zbl 1504.05272) Full Text: DOI
Ding, Guoli; Qin, Chengfu Strengthened chain theorems for different versions of 4-connectivity. (English) Zbl 1502.05109 Discrete Math. 346, No. 1, Article ID 113129, 12 p. (2023). MSC: 05C40 PDFBibTeX XMLCite \textit{G. Ding} and \textit{C. Qin}, Discrete Math. 346, No. 1, Article ID 113129, 12 p. (2023; Zbl 1502.05109) Full Text: DOI arXiv
Leaños, J.; Ndjatchi, Christophe; Ríos-Castro, L. M. On the connectivity of the disjointness graph of segments of point sets in general position in the plane. (English) Zbl 1515.05099 Discrete Math. Theor. Comput. Sci. 24, No. 1, Paper No. 15, 16 p. (2022). MSC: 05C40 52C35 PDFBibTeX XMLCite \textit{J. Leaños} et al., Discrete Math. Theor. Comput. Sci. 24, No. 1, Paper No. 15, 16 p. (2022; Zbl 1515.05099) Full Text: DOI arXiv
Wagner, Uli; Welzl, Emo Connectivity of triangulation flip graphs in the plane. (English) Zbl 1507.05027 Discrete Comput. Geom. 68, No. 4, 1227-1284 (2022). Reviewer: Tommaso Gentile (Rende) MSC: 05C10 05C40 52B05 52C35 52C45 68U05 68R10 PDFBibTeX XMLCite \textit{U. Wagner} and \textit{E. Welzl}, Discrete Comput. Geom. 68, No. 4, 1227--1284 (2022; Zbl 1507.05027) Full Text: DOI arXiv
Gollin, J. Pascal; Heuer, Karl Characterising \(k\)-connected sets in infinite graphs. (English) Zbl 1497.05191 J. Comb. Theory, Ser. B 157, 451-499 (2022). MSC: 05C63 05C40 05C75 PDFBibTeX XMLCite \textit{J. P. Gollin} and \textit{K. Heuer}, J. Comb. Theory, Ser. B 157, 451--499 (2022; Zbl 1497.05191) Full Text: DOI arXiv
dos Santos, Jaime C. On the structure of triangle-free 3-connected matroids. (English) Zbl 1496.05019 Adv. Appl. Math. 141, Article ID 102413, 37 p. (2022). MSC: 05B35 05C40 PDFBibTeX XMLCite \textit{J. C. dos Santos}, Adv. Appl. Math. 141, Article ID 102413, 37 p. (2022; Zbl 1496.05019) Full Text: DOI
Huang, Xueyi; Das, Kinkar Chandra Proof of a conjecture on communicability distance sum index of graphs. (English) Zbl 1525.05035 Linear Algebra Appl. 645, 278-292 (2022). Reviewer: Farzad Shaveisi (Kermānshāh) MSC: 05C12 05C40 05C50 PDFBibTeX XMLCite \textit{X. Huang} and \textit{K. C. Das}, Linear Algebra Appl. 645, 278--292 (2022; Zbl 1525.05035) Full Text: DOI
Hayashi, Koyo Linking four vertices in graphs of large connectivity. (English) Zbl 1484.05115 J. Comb. Theory, Ser. B 154, 136-174 (2022). MSC: 05C40 05C38 05C10 05C15 05C69 PDFBibTeX XMLCite \textit{K. Hayashi}, J. Comb. Theory, Ser. B 154, 136--174 (2022; Zbl 1484.05115) Full Text: DOI
Schweser, Thomas; Stiebitz, Michael; Toft, Bjarne Coloring hypergraphs of low connectivity. (English) Zbl 1482.05120 J. Comb. 13, No. 1, 1-21 (2022). MSC: 05C15 05C65 05C40 PDFBibTeX XMLCite \textit{T. Schweser} et al., J. Comb. 13, No. 1, 1--21 (2022; Zbl 1482.05120) Full Text: DOI arXiv
Brettell, Nick; Whittle, Geoff; Williams, Alan \(N\)-detachable pairs in 3-connected matroids. III: The theorem. (English) Zbl 1481.05023 J. Comb. Theory, Ser. B 153, 223-290 (2022). MSC: 05B35 05C40 52B40 PDFBibTeX XMLCite \textit{N. Brettell} et al., J. Comb. Theory, Ser. B 153, 223--290 (2022; Zbl 1481.05023) Full Text: DOI arXiv
An, Hyung-Chan; Kleinberg, Robert A diameter-revealing proof of the Bondy-Lovász lemma. (English) Zbl 07444814 Inf. Process. Lett. 174, Article ID 106194, 4 p. (2022). MSC: 05C70 05C12 05C85 05C40 PDFBibTeX XMLCite \textit{H.-C. An} and \textit{R. Kleinberg}, Inf. Process. Lett. 174, Article ID 106194, 4 p. (2022; Zbl 07444814) Full Text: DOI arXiv
Briański, Marcin; Szady, Adam A short note on graphs with long Thomason chains. (English) Zbl 1476.05039 Discrete Math. 345, No. 1, Article ID 112624, 9 p. (2022). MSC: 05C10 05C40 05C45 05C85 PDFBibTeX XMLCite \textit{M. Briański} and \textit{A. Szady}, Discrete Math. 345, No. 1, Article ID 112624, 9 p. (2022; Zbl 1476.05039) Full Text: DOI arXiv
Brinkmann, Gunnar A simple and elementary proof of Whitney’s unique embedding theorem. (English) Zbl 1490.05183 Ars Math. Contemp. 20, No. 2, 195-197 (2021). Reviewer: Bernd Schröder (Hattiesburg) MSC: 05C60 05C40 05C10 57M60 57M15 PDFBibTeX XMLCite \textit{G. Brinkmann}, Ars Math. Contemp. 20, No. 2, 195--197 (2021; Zbl 1490.05183) Full Text: DOI arXiv
Sabir, Eminjan; Meng, Jixiang Generalizations of the classics to spanning connectedness. (English) Zbl 1510.05166 Appl. Math. Comput. 403, Article ID 126167, 6 p. (2021). MSC: 05C45 05C40 PDFBibTeX XMLCite \textit{E. Sabir} and \textit{J. Meng}, Appl. Math. Comput. 403, Article ID 126167, 6 p. (2021; Zbl 1510.05166) Full Text: DOI
Šlapal, Josef A convenient graph connectedness for digital imagery. (English) Zbl 1474.68442 Kozubek, Tomáš (ed.) et al., High performance computing in science and engineering. 4th international conference, HPCSE 2019, Karolinka, Czech Republic, May 20–23, 2019. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 12456, 150-162 (2021). MSC: 68U10 05C40 68R10 68U05 PDFBibTeX XMLCite \textit{J. Šlapal}, Lect. Notes Comput. Sci. 12456, 150--162 (2021; Zbl 1474.68442) Full Text: DOI
Leaños, J.; Ndjatchi, Christophe The edge-connectivity of token graphs. (English) Zbl 1470.05093 Graphs Comb. 37, No. 3, 1013-1023 (2021). Reviewer: Shinya Fujita (Maebashi) MSC: 05C40 05C99 PDFBibTeX XMLCite \textit{J. Leaños} and \textit{C. Ndjatchi}, Graphs Comb. 37, No. 3, 1013--1023 (2021; Zbl 1470.05093) Full Text: DOI arXiv
Costalonga, J. P.; Kingan, S. R. \(N\)-critical matroids. (English) Zbl 1470.05031 Graphs Comb. 37, No. 3, 797-803 (2021). MSC: 05B35 52B40 PDFBibTeX XMLCite \textit{J. P. Costalonga} and \textit{S. R. Kingan}, Graphs Comb. 37, No. 3, 797--803 (2021; Zbl 1470.05031) Full Text: DOI
Hu, Yiping; Lyons, Russell; Tang, Pengfei A reverse Aldous-Broder algorithm. (English. French summary) Zbl 1468.05281 Ann. Inst. Henri Poincaré, Probab. Stat. 57, No. 2, 890-900 (2021). MSC: 05C81 05C40 05C85 05C05 60J10 60C05 PDFBibTeX XMLCite \textit{Y. Hu} et al., Ann. Inst. Henri Poincaré, Probab. Stat. 57, No. 2, 890--900 (2021; Zbl 1468.05281) Full Text: DOI arXiv
Pineda-Villavicencio, Guillermo A new proof of Balinski’s theorem on the connectivity of polytopes. (English) Zbl 1466.52017 Discrete Math. 344, No. 7, Article ID 112408, 3 p. (2021). MSC: 52B11 PDFBibTeX XMLCite \textit{G. Pineda-Villavicencio}, Discrete Math. 344, No. 7, Article ID 112408, 3 p. (2021; Zbl 1466.52017) Full Text: DOI arXiv Link
Hörsch, Florian; Szigeti, Zoltán Connectivity of orientations of 3-edge-connected graphs. (English) Zbl 1464.05216 Eur. J. Comb. 94, Article ID 103292, 18 p. (2021). MSC: 05C40 PDFBibTeX XMLCite \textit{F. Hörsch} and \textit{Z. Szigeti}, Eur. J. Comb. 94, Article ID 103292, 18 p. (2021; Zbl 1464.05216) Full Text: DOI arXiv
Czogała, Alfred; Koprowski, Przemysław Even points on an algebraic curve. (English) Zbl 1468.11145 Finite Fields Appl. 70, Article ID 101792, 16 p. (2021). Reviewer: Dimitros Poulakis (Thessaloniki) MSC: 11G20 11R65 11R45 14C22 05C40 PDFBibTeX XMLCite \textit{A. Czogała} and \textit{P. Koprowski}, Finite Fields Appl. 70, Article ID 101792, 16 p. (2021; Zbl 1468.11145) Full Text: DOI arXiv
Bahadır, Selim; Ceyhan, Elvan On the number of weakly connected subdigraphs in random \(k\)NN digraphs. (English) Zbl 1456.05079 Discrete Comput. Geom. 65, No. 1, 116-142 (2021). MSC: 05C30 05C40 60F05 60G55 05C80 05C20 PDFBibTeX XMLCite \textit{S. Bahadır} and \textit{E. Ceyhan}, Discrete Comput. Geom. 65, No. 1, 116--142 (2021; Zbl 1456.05079) Full Text: DOI arXiv
Deshmukh, Neeraj; Hogadi, Amit; Kulkarni, Girish; Yadav, Suraj Gabber’s presentation lemma over Noetherian domains. (English) Zbl 1454.14056 J. Algebra 569, 169-179 (2021). Reviewer: Sebastian Wolf (Regensburg) MSC: 14F20 14F42 PDFBibTeX XMLCite \textit{N. Deshmukh} et al., J. Algebra 569, 169--179 (2021; Zbl 1454.14056) Full Text: DOI arXiv
Lei, Lan; Li, Xiaomin; Ma, Xiaoling; Zhan, Mingquan; Lai, Hong-Jian Chvátal-Erdős conditions and almost spanning trails. (English) Zbl 1451.05200 Bull. Malays. Math. Sci. Soc. (2) 43, No. 6, 4375-4391 (2020). MSC: 05C76 05C07 05C45 05C40 PDFBibTeX XMLCite \textit{L. Lei} et al., Bull. Malays. Math. Sci. Soc. (2) 43, No. 6, 4375--4391 (2020; Zbl 1451.05200) Full Text: DOI
Doczkal, Christian; Pous, Damien Graph theory in Coq: minors, treewidth, and isomorphisms. (English) Zbl 1468.68320 J. Autom. Reasoning 64, No. 5, 795-825 (2020). MSC: 68V20 03B35 05C05 05C40 05C60 05C83 PDFBibTeX XMLCite \textit{C. Doczkal} and \textit{D. Pous}, J. Autom. Reasoning 64, No. 5, 795--825 (2020; Zbl 1468.68320) Full Text: DOI HAL
Fortier, Quentin; Király, Csaba; Szigeti, Zoltán; Tanigawa, Shin-ichi On packing spanning arborescences with matroid constraint. (English) Zbl 1495.05157 J. Graph Theory 93, No. 2, 230-252 (2020). MSC: 05C40 05C20 05B35 52B40 PDFBibTeX XMLCite \textit{Q. Fortier} et al., J. Graph Theory 93, No. 2, 230--252 (2020; Zbl 1495.05157) Full Text: DOI
Costalonga, João Paulo Contractible edges in 3-connected graphs that preserve a minor. (English) Zbl 1430.05064 J. Comb. Theory, Ser. B 140, 1-26 (2020). MSC: 05C40 05C83 PDFBibTeX XMLCite \textit{J. P. Costalonga}, J. Comb. Theory, Ser. B 140, 1--26 (2020; Zbl 1430.05064) Full Text: DOI arXiv
Choi, Ilkyoo; Furuya, Michitaka; Kim, Ringi; Park, Boram A Ramsey-type theorem for the matching number regarding connected graphs. (English) Zbl 1429.05137 Discrete Math. 343, No. 2, Article ID 111648, 6 p. (2020). MSC: 05C55 05D10 05C40 05C70 PDFBibTeX XMLCite \textit{I. Choi} et al., Discrete Math. 343, No. 2, Article ID 111648, 6 p. (2020; Zbl 1429.05137) Full Text: DOI arXiv
Le, Hoang-Oanh; Le, Van Bang A complexity dichotomy for matching cut in (bipartite) graphs of fixed diameter. (English) Zbl 1422.68125 Theor. Comput. Sci. 770, 69-78 (2019). MSC: 68Q25 05C40 05C70 05C85 68Q17 PDFBibTeX XMLCite \textit{H.-O. Le} and \textit{V. B. Le}, Theor. Comput. Sci. 770, 69--78 (2019; Zbl 1422.68125) Full Text: DOI arXiv
Mertzios, George B.; Michail, Othon; Spirakis, Paul G. Temporal network optimization subject to connectivity constraints. (English) Zbl 1421.68139 Algorithmica 81, No. 4, 1416-1449 (2019). MSC: 68R10 05C12 05C40 05C78 68Q17 68W25 90C35 PDFBibTeX XMLCite \textit{G. B. Mertzios} et al., Algorithmica 81, No. 4, 1416--1449 (2019; Zbl 1421.68139) Full Text: DOI
Chun, Carolyn; Oxley, James Towards a splitter theorem for internally 4-connected binary matroids. VII. (English) Zbl 1409.05044 Adv. Appl. Math. 104, 14-74 (2019). MSC: 05B35 05C40 52B40 PDFBibTeX XMLCite \textit{C. Chun} and \textit{J. Oxley}, Adv. Appl. Math. 104, 14--74 (2019; Zbl 1409.05044) Full Text: DOI arXiv
Weißauer, Daniel On the block number of graphs. (English) Zbl 1405.05091 SIAM J. Discrete Math. 33, No. 1, 346-357 (2019). MSC: 05C40 05C83 PDFBibTeX XMLCite \textit{D. Weißauer}, SIAM J. Discrete Math. 33, No. 1, 346--357 (2019; Zbl 1405.05091) Full Text: DOI arXiv
Qin, Chengfu; Ding, Guoli A chain theorem for 4-connected graphs. (English) Zbl 1402.05126 J. Comb. Theory, Ser. B 134, 341-349 (2019). MSC: 05C40 PDFBibTeX XMLCite \textit{C. Qin} and \textit{G. Ding}, J. Comb. Theory, Ser. B 134, 341--349 (2019; Zbl 1402.05126) Full Text: DOI
Šlapal, Josef Closure operators on graphs for modeling connectedness in digital spaces. (English) Zbl 1499.54220 Filomat 32, No. 14, 5011-5021 (2018). MSC: 54H30 54A05 05C40 52C99 PDFBibTeX XMLCite \textit{J. Šlapal}, Filomat 32, No. 14, 5011--5021 (2018; Zbl 1499.54220) Full Text: DOI
Abajo, Encarnación; Casablanca, Rocío; Diánez, Ana; García-Vázquez, Pedro On generalized 3-connectivity of the strong product of graphs. (English) Zbl 1488.05278 Appl. Anal. Discrete Math. 12, No. 2, 297-317 (2018). MSC: 05C40 05C76 PDFBibTeX XMLCite \textit{E. Abajo} et al., Appl. Anal. Discrete Math. 12, No. 2, 297--317 (2018; Zbl 1488.05278) Full Text: DOI
Aamand, Anders; Hjuler, Niklas; Holm, Jacob; Rotenberg, Eva One-way trail orientations. (English) Zbl 1504.05105 Chatzigiannakis, Ioannis (ed.) et al., 45th international colloquium on automata, languages, and programming. ICALP 2018, Prague, Czech Republic, July 9–13, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 107, Article 6, 13 p. (2018). MSC: 05C20 05C40 05C85 05E30 PDFBibTeX XMLCite \textit{A. Aamand} et al., LIPIcs -- Leibniz Int. Proc. Inform. 107, Article 6, 13 p. (2018; Zbl 1504.05105) Full Text: DOI arXiv
Chowdhury, Samir; Mémoli, Facundo A functorial Dowker theorem and persistent homology of asymmetric networks. (English) Zbl 1423.55038 J. Appl. Comput. Topol. 2, No. 1-2, 115-175 (2018). MSC: 55U99 68U05 55N35 PDFBibTeX XMLCite \textit{S. Chowdhury} and \textit{F. Mémoli}, J. Appl. Comput. Topol. 2, No. 1--2, 115--175 (2018; Zbl 1423.55038) Full Text: DOI arXiv
Zhang, Yunxia; Zhang, Bo; Yang, Weihua Super spanning connectivity of tournaments. (Chinese. English summary) Zbl 1424.05174 J. North Univ. China, Nat. Sci. 39, No. 4, 404-407 (2018). MSC: 05C40 05C20 PDFBibTeX XMLCite \textit{Y. Zhang} et al., J. North Univ. China, Nat. Sci. 39, No. 4, 404--407 (2018; Zbl 1424.05174) Full Text: DOI
Chun, Carolyn; Oxley, James Towards a splitter theorem for internally 4-connected binary matroids. VI. (English) Zbl 1397.05032 Adv. Appl. Math. 101, 100-167 (2018). MSC: 05B35 05C40 05C83 52B40 PDFBibTeX XMLCite \textit{C. Chun} and \textit{J. Oxley}, Adv. Appl. Math. 101, 100--167 (2018; Zbl 1397.05032) Full Text: DOI arXiv
Leaños, J.; Trujillo-Negrete, A. L. The connectivity of token graphs. (English) Zbl 1395.05096 Graphs Comb. 34, No. 4, 777-790 (2018). MSC: 05C40 PDFBibTeX XMLCite \textit{J. Leaños} and \textit{A. L. Trujillo-Negrete}, Graphs Comb. 34, No. 4, 777--790 (2018; Zbl 1395.05096) Full Text: DOI
Joó, Attila Countable Menger’s theorem with finitary matroid constraints on the ingoing edges. (English) Zbl 1393.05134 Electron. J. Comb. 25, No. 3, Research Paper P3.12, 10 p. (2018). MSC: 05C20 05C38 05C40 05B35 05C63 05C30 PDFBibTeX XMLCite \textit{A. Joó}, Electron. J. Comb. 25, No. 3, Research Paper P3.12, 10 p. (2018; Zbl 1393.05134) Full Text: arXiv Link
Stiebitz, Michael; Toft, Bjarne A Brooks type theorem for the maximum local edge connectivity. (English) Zbl 1392.05043 Electron. J. Comb. 25, No. 1, Research Paper P1.50, 11 p. (2018). MSC: 05C15 PDFBibTeX XMLCite \textit{M. Stiebitz} and \textit{B. Toft}, Electron. J. Comb. 25, No. 1, Research Paper P1.50, 11 p. (2018; Zbl 1392.05043) Full Text: arXiv Link
Alstrup, Stephen; Georgakopoulos, Agelos; Rotenberg, Eva; Thomassen, Carsten A Hamiltonian cycle in the square of a 2-connected graph in linear time. (English) Zbl 1403.05077 Czumaj, Artur (ed.), Proceedings of the 29th annual ACM-SIAM symposium on discrete algorithms, SODA 2018, New Orleans, LA, USA, January 7–10, 2018. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-61197-503-1/ebook). 1645-1649 (2018). MSC: 05C45 05C40 PDFBibTeX XMLCite \textit{S. Alstrup} et al., in: Proceedings of the 29th annual ACM-SIAM symposium on discrete algorithms, SODA 2018, New Orleans, LA, USA, January 7--10, 2018. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1645--1649 (2018; Zbl 1403.05077) Full Text: Link
Otera, Daniele Ettore On Poénaru’s inverse-representations. (English) Zbl 1422.57003 Quaest. Math. 40, No. 2, 277-293 (2017). MSC: 57M07 57M20 57M35 20F65 57-02 PDFBibTeX XMLCite \textit{D. E. Otera}, Quaest. Math. 40, No. 2, 277--293 (2017; Zbl 1422.57003) Full Text: DOI
Palacios, José Luis Bounds for the augmented Zagreb and the atom-bond connectivity indices. (English) Zbl 1411.05149 Appl. Math. Comput. 307, 141-145 (2017); corrigendum ibid. 362, Article ID 124559, 4 p. (2019). MSC: 05C40 92E10 PDFBibTeX XMLCite \textit{J. L. Palacios}, Appl. Math. Comput. 307, 141--145 (2017; Zbl 1411.05149) Full Text: DOI
Thomassen, Carsten Nash-Williams’ cycle-decomposition theorem. (English) Zbl 1413.05195 Combinatorica 37, No. 5, 1027-1037 (2017). MSC: 05C38 05C40 05C63 05C70 PDFBibTeX XMLCite \textit{C. Thomassen}, Combinatorica 37, No. 5, 1027--1037 (2017; Zbl 1413.05195) Full Text: DOI Link
Chen, Ran; Lévy, Jean-Jacques A semi-automatic proof of strong connectivity. (English) Zbl 1403.68221 Paskevich, Andrei (ed.) et al., Verified software. Theories, tools, and experiments. 9th international conference, VSTTE 2017, Heidelberg, Germany, July 22–23, 2017. Revised selected papers. Cham: Springer (ISBN 978-3-319-72307-5/pbk; 978-3-319-72308-2/ebook). Lecture Notes in Computer Science 10712, 49-65 (2017). MSC: 68T15 05-04 05C20 05C40 PDFBibTeX XMLCite \textit{R. Chen} and \textit{J.-J. Lévy}, Lect. Notes Comput. Sci. 10712, 49--65 (2017; Zbl 1403.68221) Full Text: DOI HAL
Šlapal, Josef Walk-set induced connectedness in digital spaces. (English) Zbl 1399.05138 Carpathian J. Math. 33, No. 2, 247-256 (2017). MSC: 05C40 68R10 05C12 05C76 68U10 PDFBibTeX XMLCite \textit{J. Šlapal}, Carpathian J. Math. 33, No. 2, 247--256 (2017; Zbl 1399.05138)
Otera, D. E.; Russo, F. G.; Tanasi, C. On \(3\)-dimensional WGSC inverse-representations of groups. (English) Zbl 1399.57001 Acta Math. Hung. 151, No. 2, 379-390 (2017). MSC: 57M07 57M20 57M35 20F65 PDFBibTeX XMLCite \textit{D. E. Otera} et al., Acta Math. Hung. 151, No. 2, 379--390 (2017; Zbl 1399.57001) Full Text: DOI
Fortier, Quentin; Király, Csaba; Szigeti, Zoltán; Tanigawa, Shin-ichi On packing spanning arborescences with matroid constraint. (English) Zbl 1378.05021 Drmota, Michael (ed.) et al., Extended abstracts of the ninth European conference on combinatorics, graph theory and applications, EuroComb 2017, Vienna, Austria, August 28 – September 1, 2017. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 61, 451-457 (2017). MSC: 05B35 52B40 PDFBibTeX XMLCite \textit{Q. Fortier} et al., Electron. Notes Discrete Math. 61, 451--457 (2017; Zbl 1378.05021) Full Text: DOI Link
Graczyk, Jacek; Świątek, Grzegorz Fine structure of connectedness loci. (English) Zbl 1381.37054 Math. Ann. 369, No. 1-2, 49-108 (2017). Reviewer: Marius Ghergu (Dublin) MSC: 37F45 37F10 31C40 PDFBibTeX XMLCite \textit{J. Graczyk} and \textit{G. Świątek}, Math. Ann. 369, No. 1--2, 49--108 (2017; Zbl 1381.37054) Full Text: DOI
Benedetti, Bruno; Bolognese, Barbara; Varbaro, Matteo Regulating Hartshorne’s connectedness theorem. (English) Zbl 1368.05085 J. Algebr. Comb. 46, No. 1, 33-50 (2017). MSC: 05C40 PDFBibTeX XMLCite \textit{B. Benedetti} et al., J. Algebr. Comb. 46, No. 1, 33--50 (2017; Zbl 1368.05085) Full Text: DOI arXiv
Aboulker, Pierre; Brettell, Nick; Havet, Frédéric; Marx, Dániel; Trotignon, Nicolas Coloring graphs with constraints on connectivity. (English) Zbl 1368.05040 J. Graph Theory 85, No. 4, 814-838 (2017). MSC: 05C15 05C40 05C35 05C07 68Q17 PDFBibTeX XMLCite \textit{P. Aboulker} et al., J. Graph Theory 85, No. 4, 814--838 (2017; Zbl 1368.05040) Full Text: DOI arXiv Link
Smith, Stephen G. Z.; Tomon, István The poset on connected graphs is Sperner. (English) Zbl 1362.05075 J. Comb. Theory, Ser. A 150, 162-181 (2017). MSC: 05C40 06A07 PDFBibTeX XMLCite \textit{S. G. Z. Smith} and \textit{I. Tomon}, J. Comb. Theory, Ser. A 150, 162--181 (2017; Zbl 1362.05075) Full Text: DOI arXiv
Robertson, Neil; Seymour, P. D.; Thomas, Robin Cyclically five-connected cubic graphs. (English) Zbl 1362.05074 J. Comb. Theory, Ser. B 125, 132-167 (2017). MSC: 05C40 PDFBibTeX XMLCite \textit{N. Robertson} et al., J. Comb. Theory, Ser. B 125, 132--167 (2017; Zbl 1362.05074) Full Text: DOI arXiv
Jojić, Duško; Vrećica, Siniša T.; Živaljević, Rade T. Multiple chessboard complexes and the colored Tverberg problem. (English) Zbl 1355.05065 J. Comb. Theory, Ser. A 145, 400-425 (2017). MSC: 05B15 05C15 05C40 PDFBibTeX XMLCite \textit{D. Jojić} et al., J. Comb. Theory, Ser. A 145, 400--425 (2017; Zbl 1355.05065) Full Text: DOI arXiv
Wang, Lin Feng On \(f\)-non-parabolic ends for Ricci-harmonic metrics. (English) Zbl 1357.53043 Ann. Global Anal. Geom. 51, No. 1, 91-107 (2017). MSC: 53C21 PDFBibTeX XMLCite \textit{L. F. Wang}, Ann. Global Anal. Geom. 51, No. 1, 91--107 (2017; Zbl 1357.53043) Full Text: DOI
Tiep, Pham H.; Vu, Van H. Non-abelian Littlewood-Offord inequalities. (English) Zbl 1346.05295 Adv. Math. 302, 1233-1250 (2016). MSC: 05D40 05C40 52C17 20C33 60B15 60C05 60G50 PDFBibTeX XMLCite \textit{P. H. Tiep} and \textit{V. H. Vu}, Adv. Math. 302, 1233--1250 (2016; Zbl 1346.05295) Full Text: DOI arXiv
Di Gennaro, Vincenzo; Franco, Davide; Marini, Giambattista Algebraic versus homological equivalence for singular varieties. (English) Zbl 1346.14012 Commun. Algebra 44, No. 6, 2547-2560 (2016). Reviewer: Alberto Collino (Verzuolo) MSC: 14C05 14C15 14C25 14F17 14F43 14F45 14J17 14M10 PDFBibTeX XMLCite \textit{V. Di Gennaro} et al., Commun. Algebra 44, No. 6, 2547--2560 (2016; Zbl 1346.14012) Full Text: DOI arXiv
Kim, Younjin; Lee, Sang June; Oum, Sang-il Dynamic coloring of graphs having no \(K_5\) minor. (English) Zbl 1335.05066 Discrete Appl. Math. 206, 81-89 (2016). MSC: 05C15 05C83 05C40 PDFBibTeX XMLCite \textit{Y. Kim} et al., Discrete Appl. Math. 206, 81--89 (2016; Zbl 1335.05066) Full Text: DOI arXiv
Penev, Irena; Thomassé, Stéphan; Trotignon, Nicolas Isolating highly connected induced subgraphs. (English) Zbl 1333.05169 SIAM J. Discrete Math. 30, No. 1, 592-619 (2016). MSC: 05C40 05C07 05C35 05C76 05C75 PDFBibTeX XMLCite \textit{I. Penev} et al., SIAM J. Discrete Math. 30, No. 1, 592--619 (2016; Zbl 1333.05169) Full Text: DOI arXiv
Kun, Gábor; Szegedy, Mario A new line of attack on the dichotomy conjecture. (English) Zbl 1327.05183 Eur. J. Comb. 52, Part B, 338-367 (2016). MSC: 05C40 68Q17 PDFBibTeX XMLCite \textit{G. Kun} and \textit{M. Szegedy}, Eur. J. Comb. 52, Part B, 338--367 (2016; Zbl 1327.05183) Full Text: DOI
Mohammadian, A. A generalization of the odd-girth theorem. (English) Zbl 1327.05095 Discrete Math. 339, No. 2, 1052-1057 (2016). MSC: 05C12 05C40 05C50 PDFBibTeX XMLCite \textit{A. Mohammadian}, Discrete Math. 339, No. 2, 1052--1057 (2016; Zbl 1327.05095) Full Text: DOI
Lim, Hyeong-Seok; Kim, Hee-Chul; Park, Jung-Heum Ore-type degree conditions for disjoint path covers in simple graphs. (English) Zbl 1327.05276 Discrete Math. 339, No. 2, 770-779 (2016). MSC: 05C70 05C38 05C40 PDFBibTeX XMLCite \textit{H.-S. Lim} et al., Discrete Math. 339, No. 2, 770--779 (2016; Zbl 1327.05276) Full Text: DOI
Li, Peng; Wu, Yaokun Spanning connectedness and Hamiltonian thickness of graphs and interval graphs. (English) Zbl 1350.05079 Discrete Math. Theor. Comput. Sci. 16, No. 2, 125-210 (2014). MSC: 05C40 05C45 05C38 PDFBibTeX XMLCite \textit{P. Li} and \textit{Y. Wu}, Discrete Math. Theor. Comput. Sci. 16, No. 2, 125--210 (2015; Zbl 1350.05079) Full Text: Link
Epple, Dennis D. A.; Huang, Jing A Brooks-type theorem for the bichromatic number. (English) Zbl 1330.05063 J. Graph Theory 80, No. 4, 277-286 (2015). MSC: 05C15 05C40 05C75 PDFBibTeX XMLCite \textit{D. D. A. Epple} and \textit{J. Huang}, J. Graph Theory 80, No. 4, 277--286 (2015; Zbl 1330.05063) Full Text: DOI
Archdeacon, Dan; Kotrbčík, Michal; Nedela, Roman; Škoviera, Martin Maximum genus, connectivity, and Nebeský’s theorem. (English) Zbl 1329.05074 Ars Math. Contemp. 9, No. 1, 51-61 (2015). MSC: 05C10 05C40 05C35 PDFBibTeX XMLCite \textit{D. Archdeacon} et al., Ars Math. Contemp. 9, No. 1, 51--61 (2015; Zbl 1329.05074) Full Text: DOI
Bau, Sheng; van Niekerk, Benjamin; White, David An intermediate value theorem for the decycling numbers of Toeplitz graphs. (English) Zbl 1328.05100 Graphs Comb. 31, No. 6, 2037-2042 (2015). MSC: 05C38 05C40 PDFBibTeX XMLCite \textit{S. Bau} et al., Graphs Comb. 31, No. 6, 2037--2042 (2015; Zbl 1328.05100) Full Text: DOI
Xu, Easton Li; Han, Guangyue The minimum number of hubs in networks. (English) Zbl 1355.90102 J. Comb. Optim. 30, No. 4, 1196-1218 (2015). MSC: 90C35 PDFBibTeX XMLCite \textit{E. L. Xu} and \textit{G. Han}, J. Comb. Optim. 30, No. 4, 1196--1218 (2015; Zbl 1355.90102) Full Text: DOI arXiv
Chen, Guantao; Li, Yinkui; Ma, Haicheng; Wu, Tingzeng; Xiong, Liming An extension of the Chvátal-Erdős theorem: counting the number of maximum independent sets. (English) Zbl 1316.05063 Graphs Comb. 31, No. 4, 885-896 (2015). MSC: 05C30 05C69 05C40 05C35 PDFBibTeX XMLCite \textit{G. Chen} et al., Graphs Comb. 31, No. 4, 885--896 (2015; Zbl 1316.05063) Full Text: DOI
Geelen, Jim; van Zwam, Stefan H. M. Matroid 3-connectivity and branch width. (English) Zbl 1310.05048 J. Comb. Theory, Ser. B 112, 104-123 (2015). MSC: 05B35 05C40 PDFBibTeX XMLCite \textit{J. Geelen} and \textit{S. H. M. van Zwam}, J. Comb. Theory, Ser. B 112, 104--123 (2015; Zbl 1310.05048) Full Text: DOI arXiv
Lammich, Peter Verified efficient implementation of Gabow’s strongly connected component algorithm. (English) Zbl 1416.68168 Klein, Gerwin (ed.) et al., Interactive theorem proving. 5th international conference, ITP 2014, held as part of the Vienna summer of logic, VSL 2014, Vienna, Austria, July 14–17, 2014. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 8558, 325-340 (2014). MSC: 68T15 05C20 05C40 05C85 PDFBibTeX XMLCite \textit{P. Lammich}, Lect. Notes Comput. Sci. 8558, 325--340 (2014; Zbl 1416.68168) Full Text: DOI
Munson, Brian A. A purely homotopy-theoretic proof of the Blakers-Massey theorem for \(n\)-cubes. (English) Zbl 1296.55014 Homology Homotopy Appl. 16, No. 1, 333-339 (2014). Reviewer: Richard John Steiner (Glasgow) MSC: 55P99 PDFBibTeX XMLCite \textit{B. A. Munson}, Homology Homotopy Appl. 16, No. 1, 333--339 (2014; Zbl 1296.55014) Full Text: DOI arXiv Euclid
Pokrovskiy, Alexey Edge growth in graph powers. (English) Zbl 1296.05108 Australas. J. Comb. 58, Part 2, 347-357 (2014). MSC: 05C40 05C12 05C25 PDFBibTeX XMLCite \textit{A. Pokrovskiy}, Australas. J. Comb. 58, Part 2, 347--357 (2014; Zbl 1296.05108) Full Text: arXiv Link
Huynh, Tony; van Zwam, Stefan H. M. Intertwining connectivities in representable matroids. (English) Zbl 1293.05034 SIAM J. Discrete Math. 28, No. 1, 188-196 (2014). MSC: 05B35 05C40 PDFBibTeX XMLCite \textit{T. Huynh} and \textit{S. H. M. van Zwam}, SIAM J. Discrete Math. 28, No. 1, 188--196 (2014; Zbl 1293.05034) Full Text: DOI arXiv
Chun, Carolyn; Mayhew, Dillon; Oxley, James Towards a splitter theorem for internally 4-connected binary matroids. V. (English) Zbl 1281.05039 Adv. Appl. Math. 52, 60-81 (2014). MSC: 05B35 05C40 PDFBibTeX XMLCite \textit{C. Chun} et al., Adv. Appl. Math. 52, 60--81 (2014; Zbl 1281.05039) Full Text: DOI
Chun, Carolyn; Mayhew, Dillon; Oxley, James Towards a splitter theorem for internally 4-connected binary matroids. IV. (English) Zbl 1281.05038 Adv. Appl. Math. 52, 1-59 (2014). MSC: 05B35 05C40 PDFBibTeX XMLCite \textit{C. Chun} et al., Adv. Appl. Math. 52, 1--59 (2014; Zbl 1281.05038) Full Text: DOI
Kao, Shin-Shin; Huang, Hua-Min; Hsu, Kung-Ming; Hsu, Lih-Hsing Cubic 1-fault-tolerant Hamiltonian graphs, globally \(3^\ast \)-connected graphs, and super 3-spanning connected graphs. (English) Zbl 1313.05216 Ars Comb. 110, 301-322 (2013). MSC: 05C45 05C40 PDFBibTeX XMLCite \textit{S.-S. Kao} et al., Ars Comb. 110, 301--322 (2013; Zbl 1313.05216)
Chun, Carolyn; Mayhew, Dillon; Oxley, James Towards a splitter theorem for internally 4-connected binary matroids. III. (English) Zbl 1281.05037 Adv. Appl. Math. 51, No. 2, 309-344 (2013). MSC: 05B35 05C40 PDFBibTeX XMLCite \textit{C. Chun} et al., Adv. Appl. Math. 51, No. 2, 309--344 (2013; Zbl 1281.05037) Full Text: DOI
Poénaru, Valentin Equivariant, locally finite inverse representations with uniformly bounded zipping length, for arbitrary finitely presented groups. (English) Zbl 1354.20027 Geom. Dedicata 167, 91-121 (2013). MSC: 20F65 20F05 55M05 57M10 57M35 57M40 57N10 57S30 PDFBibTeX XMLCite \textit{V. Poénaru}, Geom. Dedicata 167, 91--121 (2013; Zbl 1354.20027) Full Text: DOI arXiv
Chun, Carolyn; Mayhew, Dillon; Oxley, James Constructing internally 4-connected binary matroids. (English) Zbl 1256.05038 Adv. Appl. Math. 50, No. 1, 16-45 (2013). MSC: 05B35 05C40 PDFBibTeX XMLCite \textit{C. Chun} et al., Adv. Appl. Math. 50, No. 1, 16--45 (2013; Zbl 1256.05038) Full Text: DOI
Rodríguez, Rubí E.; Kra, Irwin; Gilman, Jane P. Complex analysis. In the spirit of Lipman Bers. 2nd revised ed. (English) Zbl 1262.30002 Graduate Texts in Mathematics 245. New York, NY: Springer (ISBN 978-1-4419-7322-1/hbk; 978-1-4419-7323-8/ebook). xviii, 306 p. (2013). Reviewer: Fernando Perez-Gonzalez (La Laguna) MSC: 30-01 32-01 PDFBibTeX XMLCite \textit{R. E. Rodríguez} et al., Complex analysis. In the spirit of Lipman Bers. 2nd revised ed. New York, NY: Springer (2013; Zbl 1262.30002) Full Text: DOI
Xu, Zhonghao; Higuchi, Yasunari; Hu, Chunhua Limit behaviors of random connected graphs driven by a Poisson process. (English. Russian original) Zbl 1280.05122 Theor. Math. Phys. 172, No. 1, 901-910 (2012); translation from Teor. Mat. Fiz. 172, No. 1, 28-39 (2012). MSC: 05C80 05C40 60F05 60K35 PDFBibTeX XMLCite \textit{Z. Xu} et al., Theor. Math. Phys. 172, No. 1, 901--910 (2012; Zbl 1280.05122); translation from Teor. Mat. Fiz. 172, No. 1, 28--39 (2012) Full Text: DOI
Faris, W. G. Biconnected graphs and the multivariate virial expansion. (English) Zbl 1272.82008 Markov Process. Relat. Fields 18, No. 3, 357-386 (2012). MSC: 82B20 60K35 05C40 05A15 82B05 05C30 PDFBibTeX XMLCite \textit{W. G. Faris}, Markov Process. Relat. Fields 18, No. 3, 357--386 (2012; Zbl 1272.82008)
Lee, Jae-Ha; Park, Jung-Heum General-demand disjoint path covers in a graph with faulty elements. (English) Zbl 1257.05073 Int. J. Comput. Math. 89, No. 5, 606-617 (2012). MSC: 05C38 05C40 05C45 05C65 68R10 90B18 PDFBibTeX XMLCite \textit{J.-H. Lee} and \textit{J.-H. Park}, Int. J. Comput. Math. 89, No. 5, 606--617 (2012; Zbl 1257.05073) Full Text: DOI