Ok, S.; Thomassen, C. On the minimum number of spanning trees in \(k\)-edge-connected graphs. (English) Zbl 1359.05023 J. Graph Theory 84, No. 3, 286-296 (2017). MSC: 05C05 05C40 PDF BibTeX XML Cite \textit{S. Ok} and \textit{C. Thomassen}, J. Graph Theory 84, No. 3, 286--296 (2017; Zbl 1359.05023) Full Text: DOI
Ok, Seongmin; Richter, R. Bruce; Thomassen, Carsten Liftings in finite graphs and linkages in infinite graphs with prescribed edge-connectivity. (English) Zbl 1353.05074 Graphs Comb. 32, No. 6, 2575-2589 (2016). MSC: 05C40 PDF BibTeX XML Cite \textit{S. Ok} et al., Graphs Comb. 32, No. 6, 2575--2589 (2016; Zbl 1353.05074) Full Text: DOI
Alahmadi, A.; Aldred, R. E. L.; de la Cruz, R.; Ok, S.; Solé, P.; Thomassen, C. The minimum number of minimal codewords in an \([n, k]\)-code and in graphic codes. (English) Zbl 1311.05027 Discrete Appl. Math. 184, 32-39 (2015). MSC: 05B35 94B25 PDF BibTeX XML Cite \textit{A. Alahmadi} et al., Discrete Appl. Math. 184, 32--39 (2015; Zbl 1311.05027) Full Text: DOI