2 citations · 4 across the 5 of their papers we have counts for
5 papers · 1 filter
The Bipartition Polynomial of a Graph: Reconstruction, Decomposition, and Applications
Seongmin Ok, Peter Tittmann
The bipartition polynomial of a graph is a generalization of many other graph polynomials, including the domination, Ising, matching, independence, cut, and Euler polynomial. We sh…
Density of Zeros of the Tutte Polynomial
Seongmin Ok, Thomas J. Perrett
The Tutte polynomial of a graph is a two-variable polynomial whose zeros and evaluations encode many interesting properties of the graph. In this article we investigate the zeros o…
Characterizing graphs of maximum matching width at most 2
Jisu Jeong, Seongmin Ok, Geewon Suh
The maximum matching width is a width-parameter that is defined on a branch-decomposition over the vertex set of a graph. The size of a maximum matching in the bipartite graph is u…
Dynamic choosability of triangle-free graphs and sparse random graphs
Jaehoon Kim, Seongmin Ok
The \textit{-dynamic choosability} of a graph , written , is the least such that whenever each vertex is assigned a list of at least colors a proper co…
Characterizing width two for variants of treewidth
Hans L. Bodlaender, Vincent J. C. Kreuzen, Stefan Kratsch +2
In this paper, we consider the notion of \emph{special treewidth}, recently introduced by Courcelle\cite{Courcelle2012}. In a special tree decomposition, for each vertex in a g…