1 citations · 1 across the 2 of their papers we have counts for
2 papers
math.CO2017
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…
math.CO2016★ 1 cited
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…