Xin Zhang (张欣), On the equitable tree-coloring of graphs with low degeneracy
Room B232 IBS (기초과학연구원)A (vertex)
A (vertex)
Given a graph
Integer programming is the problem of optimizing a linear function over the set of integer solutions satisfying a system of inequalities. The most successful technique in practice is the so-called …
Our problem can be described in terms of a two player game, played with the set
The strong clique number of a graph
A dibond in a directed graph is a bond (i.e. a minimal non-empty cut) for which all of its edges are directed to a common side of the cut. A …
In 1964, Erdős, Hajnal and Moon introduced a saturation version of Turán's classical theorem in extremal graph theory. In particular, they determined the minimum number of edges in a
For a vertex v of a graph G, the local complementation at v is an operation to obtain a new graph denoted by G*v from G such that two distinct vertices x, …
Given a graph
KSIAM 2020 Spring Conference will be held at IBS from May 8, 2020 to May 9, 2020. Organized by Korean Society for Industrial and Applied Mathematics. Organizing Committee Myungjoo Kang …