Jeong, Jisu; Ok, Seongmin; Suh, Geewon Characterizing graphs of maximum matching width at most 2. (English) Zbl 1395.05133 Discrete Appl. Math. 248, 102-113 (2018). MSC: 05C70 05C35 PDF BibTeX XML Cite \textit{J. Jeong} et al., Discrete Appl. Math. 248, 102--113 (2018; Zbl 1395.05133) Full Text: DOI arXiv
Kim, Jaehoon; Ok, Seongmin Dynamic choosability of triangle-free graphs and sparse random graphs. (English) Zbl 1386.05060 J. Graph Theory 87, No. 3, 347-355 (2018). MSC: 05C15 05C42 05C80 PDF BibTeX XML Cite \textit{J. Kim} and \textit{S. Ok}, J. Graph Theory 87, No. 3, 347--355 (2018; Zbl 1386.05060) Full Text: DOI
Ok, Seongmin; Perrett, Thomas J. Density of real zeros of the Tutte polynomial. (English) Zbl 1388.05093 Comb. Probab. Comput. 27, No. 3, 398-410 (2018). MSC: 05C31 PDF BibTeX XML Cite \textit{S. Ok} and \textit{T. J. Perrett}, Comb. Probab. Comput. 27, No. 3, 398--410 (2018; Zbl 1388.05093) Full Text: DOI
Ok, Seongmin; Perrett, Thomas J. Density of real zeros of the Tutte polynomial. (English) Zbl 1378.05098 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, 941-946 (2017). MSC: 05C31 PDF BibTeX XML Cite \textit{S. Ok} and \textit{T. J. Perrett}, Electron. Notes Discrete Math. 61, 941--946 (2017; Zbl 1378.05098) Full Text: DOI
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
Bodlaender, Hans L.; Kratsch, Stefan; Kreuzen, Vincent J. C.; Kwon, O-joung; Ok, Seongmin Characterizing width two for variants of treewidth. (English) Zbl 1350.05116 Discrete Appl. Math. 216, Part 1, 29-46 (2017). MSC: 05C69 05C70 05C05 03B15 PDF BibTeX XML Cite \textit{H. L. Bodlaender} et al., Discrete Appl. Math. 216, Part 1, 29--46 (2017; Zbl 1350.05116) 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