Showing results 1 to 5 of 5
3-coloring triangle-free planar graphs with a precolored 9-cycle Choi, Ilkyoo; Ekstein, Jan; Holub, Přemysl; Lidický, Bernard, 25th International Workshop on Combinatorial Algorithms, IWOCA 2014, pp.98 - 109, Springer Verlag, 2014-10 |
A Ramsey-type theorem for the matching number regarding connected graphs Choi, Ilkyoo; Furuya, Michitaka; Kim, Ringi; Park, Boram, DISCRETE MATHEMATICS, v.343, no.2, 2020-02 |
Characterization of forbidden subgraphs for bounded star chromatic number Choi, Ilkyoo; Kim, Ringi; Park, Boram, DISCRETE MATHEMATICS, v.342, no.3, pp.635 - 642, 2019-03 |
Largest 2-Regular Subgraphs in 3-Regular Graphs Choi, Ilkyoo; Kim, Ringi; Kostochka, Alexandr V.; Park, Boram; West, Douglas B., GRAPHS AND COMBINATORICS, v.35, no.4, pp.805 - 813, 2019-07 |
The layer number of alpha-evenly distributed point sets Choi, Ilkyoo; Joo, Weonyoung; Kim, Minki, DISCRETE MATHEMATICS, v.343, no.10, 2020-10 |
Discover