Lo, On-Hei Solomon; Schmidt, Jens M. Generalized cut trees for edge-connectivity. (English) Zbl 07787803 J. Comb. Theory, Ser. B 165, 47-67 (2024). MSC: 05C40 05C05 68R10 05C85 PDFBibTeX XMLCite \textit{O.-H. S. Lo} and \textit{J. M. Schmidt}, J. Comb. Theory, Ser. B 165, 47--67 (2024; Zbl 07787803) Full Text: DOI
Li, Xueliang; Weng, Yindi Further results on the rainbow vertex-disconnection of graphs. (English) Zbl 1471.05036 Bull. Malays. Math. Sci. Soc. (2) 44, No. 5, 3445-3460 (2021). MSC: 05C15 05C40 05C35 05C80 PDFBibTeX XMLCite \textit{X. Li} and \textit{Y. Weng}, Bull. Malays. Math. Sci. Soc. (2) 44, No. 5, 3445--3460 (2021; Zbl 1471.05036) Full Text: DOI arXiv
Bai, Xu Qing; Chen, You; Li, Ping; Li, Xue Liang; Weng, Yin Di The rainbow vertex-disconnection in graphs. (English) Zbl 1462.05130 Acta Math. Sin., Engl. Ser. 37, No. 2, 249-261 (2021). MSC: 05C15 05C40 PDFBibTeX XMLCite \textit{X. Q. Bai} et al., Acta Math. Sin., Engl. Ser. 37, No. 2, 249--261 (2021; Zbl 1462.05130) Full Text: DOI arXiv
Preißer, Johanna E.; Schmidt, Jens M. Computing vertex-disjoint paths in large graphs using MAOs. (English) Zbl 1436.68256 Algorithmica 82, No. 1, 146-162 (2020). MSC: 68R10 05C38 05C40 05C85 68W40 PDFBibTeX XMLCite \textit{J. E. Preißer} and \textit{J. M. Schmidt}, Algorithmica 82, No. 1, 146--162 (2020; Zbl 1436.68256) Full Text: DOI Link
Lo, On-Hei S.; Schmidt, Jens M. A cut tree representation for pendant pairs. (English) Zbl 07561392 Hsu, Wen-Lian (ed.) et al., 29th international symposium on algorithms and computation, ISAAC 2018, December 16–19, 2018, Jiaoxi, Yilan, Taiwan. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 123, Article 38, 9 p. (2018). MSC: 68Wxx PDFBibTeX XMLCite \textit{O.-H. S. Lo} and \textit{J. M. Schmidt}, LIPIcs -- Leibniz Int. Proc. Inform. 123, Article 38, 9 p. (2018; Zbl 07561392) Full Text: DOI
Preißer, Johanna E.; Schmidt, Jens M. Computing vertex-disjoint paths in large graphs using MAOs. (English) Zbl 07561367 Hsu, Wen-Lian (ed.) et al., 29th international symposium on algorithms and computation, ISAAC 2018, December 16–19, 2018, Jiaoxi, Yilan, Taiwan. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 123, Article 13, 12 p. (2018). MSC: 68R10 05C38 05C40 05C85 68W40 PDFBibTeX XMLCite \textit{J. E. Preißer} and \textit{J. M. Schmidt}, LIPIcs -- Leibniz Int. Proc. Inform. 123, Article 13, 12 p. (2018; Zbl 07561367) Full Text: DOI
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
Dross, François; Montassier, Mickael; Pinlou, Alexandre Partitioning sparse graphs into an independent set and a forest of bounded degree. (English) Zbl 1391.05091 Electron. J. Comb. 25, No. 1, Research Paper P1.45, 11 p. (2018). MSC: 05C10 05C70 05C15 PDFBibTeX XMLCite \textit{F. Dross} et al., Electron. J. Comb. 25, No. 1, Research Paper P1.45, 11 p. (2018; Zbl 1391.05091) Full Text: arXiv Link
Li, Xueliang; Zhao, Yan On extremal graphs with exactly one Steiner tree connecting any \(k\) vertices. (English) Zbl 1383.05170 Australas. J. Comb. 70, Part 1, 1-11 (2018). MSC: 05C35 05C40 05C05 PDFBibTeX XMLCite \textit{X. Li} and \textit{Y. Zhao}, Australas. J. Comb. 70, Part 1, 1--11 (2018; Zbl 1383.05170) Full Text: arXiv Link
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
Li, Xueliang; Mao, Yaping On extremal graphs with at most \(\ell\) internally disjoint Steiner trees connecting any \(n-1\) vertices. (English) Zbl 1328.05046 Graphs Comb. 31, No. 6, 2231-2259 (2015). MSC: 05C05 05C35 05C40 05C70 PDFBibTeX XMLCite \textit{X. Li} and \textit{Y. Mao}, Graphs Comb. 31, No. 6, 2231--2259 (2015; Zbl 1328.05046) Full Text: DOI arXiv
Nagamochi, Hiroshi Sparse connectivity certificates via MA orderings in graphs. (English) Zbl 1129.05025 Discrete Appl. Math. 154, No. 16, 2411-2417 (2006). MSC: 05C40 PDFBibTeX XMLCite \textit{H. Nagamochi}, Discrete Appl. Math. 154, No. 16, 2411--2417 (2006; Zbl 1129.05025) Full Text: DOI
Kühn, Daniela; Osthus, Deryk Extremal connectivity for topological cliques in bipartite graphs. (English) Zbl 1080.05044 J. Comb. Theory, Ser. B 96, No. 1, 73-99 (2006). Reviewer: Hang Tong Lau (Montréal) MSC: 05C35 05C40 05C80 PDFBibTeX XMLCite \textit{D. Kühn} and \textit{D. Osthus}, J. Comb. Theory, Ser. B 96, No. 1, 73--99 (2006; Zbl 1080.05044) Full Text: DOI
Berg, Alex R.; Jordán, Tibor Sparse certificates and removable cycles in \(l\)-mixed \(p\)-connected graphs. (English) Zbl 1099.05050 Oper. Res. Lett. 33, No. 2, 111-114 (2005). MSC: 05C40 PDFBibTeX XMLCite \textit{A. R. Berg} and \textit{T. Jordán}, Oper. Res. Lett. 33, No. 2, 111--114 (2005; Zbl 1099.05050) Full Text: DOI
Even, Shimon; Itkis, Gene; Rajsbaum, Sergio On mixed connectivity certificates. (English) Zbl 0913.68147 Theor. Comput. Sci. 203, No. 2, 253-269 (1998). MSC: 68R10 68W15 PDFBibTeX XMLCite \textit{S. Even} et al., Theor. Comput. Sci. 203, No. 2, 253--269 (1998; Zbl 0913.68147) Full Text: DOI
Even, Shimon; Itkis, Gene; Rajsbaum, Sergio On mixed connectivity certificates (extended abstract). (English) Zbl 1512.68213 Spirakis, Paul (ed.), Algorithms – ESA ’95. 3rd annual European symposium, Corfu, Greece, September 25–27, 1995. Proceedings. Berlin: Springer-Verlag. Lect. Notes Comput. Sci. 979, 1-16 (1995). MSC: 68R10 05C40 68W15 PDFBibTeX XMLCite \textit{S. Even} et al., Lect. Notes Comput. Sci. 979, 1--16 (1995; Zbl 1512.68213) Full Text: DOI
Hamidoune, Yahya Ould; Las Vergnas, Michel Local edge-connectivity in regular bipartite graphs. (English) Zbl 0662.05042 J. Comb. Theory, Ser. B 44, No. 3, 370-371 (1988). Reviewer: N.C.Wormald MSC: 05C40 PDFBibTeX XMLCite \textit{Y. O. Hamidoune} and \textit{M. Las Vergnas}, J. Comb. Theory, Ser. B 44, No. 3, 370--371 (1988; Zbl 0662.05042) Full Text: DOI
Thomassen, Carsten Even cycles in directed graphs. (English) Zbl 0606.05039 Eur. J. Comb. 6, 85-89 (1985). Reviewer: L.Lesniak MSC: 05C38 05C20 PDFBibTeX XMLCite \textit{C. Thomassen}, Eur. J. Comb. 6, 85--89 (1985; Zbl 0606.05039) Full Text: DOI
Hemminger, R. L.; Jung, H. A. On \(n\)-skein isomorphisms of graphs. (English) Zbl 0465.05043 J. Comb. Theory, Ser. B 32, 103-111 (1982). MSC: 05C40 05C38 PDFBibTeX XMLCite \textit{R. L. Hemminger} and \textit{H. A. Jung}, J. Comb. Theory, Ser. B 32, 103--111 (1982; Zbl 0465.05043) Full Text: DOI
Hamidoune, Yahya Ould An application of connectivity theory in graphs to factorizations of elements in groups. (English) Zbl 0473.05032 Eur. J. Comb. 2, 349-355 (1981). MSC: 05C25 05C40 20B99 PDFBibTeX XMLCite \textit{Y. O. Hamidoune}, Eur. J. Comb. 2, 349--355 (1981; Zbl 0473.05032) Full Text: DOI