Ilkyoo Choi

activity

20132026

most citedStrong edge-colorings of sparse graphs with large maximum degree

17 citations · 116 across the 43 of their papers we have counts for

collaborators

Showing 2015Show all

2 papers · 1 filter

math.CO2015★ 9 cited

The difference and ratio of the fractional matching number and the matching number of graphs

Ilkyoo Choi, Jaehoon Kim, Suil O

Given a graph $G$ , the matching number of $G$ , written $α^{'} (G)$ , is the maximum size of a matching in $G$ , and the fractional matching number of $G$ , written $α_{f}^{'} (G)$ , is the maxim…

math.CO2015★ 5 cited

Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors

Ilkyoo Choi, O-joung Kwon, Sang-il Oum

A fan $F_{k}$ is a graph that consists of an induced path on $k$ vertices and an additional vertex that is adjacent to all vertices of the path. We prove that for all positive intege…