Seongmin Ok

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Characterizing graphs of maximum matching width at most 2 Discrete Applied Mathematics	2018-09-17	Paper
Characterizing graphs of maximum matching width at most 2 Discrete Applied Mathematics	2018-09-17	Paper
Dynamic choosability of triangle-free graphs and sparse random graphs Journal of Graph Theory	2018-04-27	Paper
Density of real zeros of the Tutte polynomial Combinatorics, Probability and Computing	2018-04-23	Paper
Density of real zeros of the Tutte polynomial	2018-01-18	Paper
On the Minimum Number of Spanning Trees in<i>k</i>-Edge-Connected Graphs Journal of Graph Theory	2017-04-21	Paper
The Bipartition Polynomial of a Graph: Reconstruction, Decomposition, and Applications	2017-02-12	Paper
Liftings in finite graphs and linkages in infinite graphs with prescribed edge-connectivity Graphs and Combinatorics	2017-01-13	Paper
Characterizing width two for variants of treewidth Discrete Applied Mathematics	2016-11-24	Paper
The minimum number of minimal codewords in an \([n, k]\)-code and in graphic codes Discrete Applied Mathematics	2015-04-28	Paper

Research outcomes over time

This page was built for person: Seongmin Ok