The following pages link to Seongmin Ok (Q344826):
Displaying 9 items.
- Characterizing width two for variants of treewidth (Q344827) (← links)
- Liftings in finite graphs and linkages in infinite graphs with prescribed edge-connectivity (Q503651) (← links)
- Density of real zeros of the Tutte polynomial (Q1690039) (← links)
- (Q2341749) (redirect page) (← links)
- The minimum number of minimal codewords in an \([n, k]\)-code and in graphic codes (Q2341750) (← links)
- Characterizing graphs of maximum matching width at most 2 (Q2413972) (← links)
- On the Minimum Number of Spanning Trees in<i>k</i>-Edge-Connected Graphs (Q2978176) (← links)
- Density of Real Zeros of the Tutte Polynomial (Q4635510) (← links)
- Dynamic choosability of triangle‐free graphs and sparse random graphs (Q4638632) (← links)
