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
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
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