4 citations · 5 across the 3 of their papers we have counts for
4 papers
Online Ramsey theory for a triangle on -free graphs
Hojin Choi, Ilkyoo Choi, Jisu Jeong +1
Given a class of graphs and a fixed graph , the online Ramsey game for on is a game between two players Builder and Painter as follows: an unbound…
Computing the maximum matching width is NP-hard
Kwangjun Ahn, Jisu Jeong
The maximum matching width is a graph width parameter that is defined on a branch-decomposition over the vertex set of a graph. In this short paper, we prove that the problem of co…
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…
Maximum matching width: new characterizations and a fast algorithm for dominating set
Jisu Jeong, Sigve Hortemo Sæther, Jan Arne Telle
We give alternative definitions for maximum matching width, e.g. a graph has if and only if it is a subgraph of a chordal graph and for every…