Showing results 1 to 3 of 3
On Choosability with Separation of Planar Graphs with Forbidden Cycles Choi, Ilkyoo; Lidicky, Bernard; Stolee, Derrick, JOURNAL OF GRAPH THEORY, v.81, no.3, pp.283 - 306, 2016-03 |
Planar graphs with girth at least 5 are (3,5)-colorable Choi, Ilkyoo; Raspaud, Andre, DISCRETE MATHEMATICS, v.338, no.4, pp.661 - 667, 2015-04 |
Toroidal graphs containing neither K-5(-) nor 6-cycles are 4-choosable Choi, Ilkyoo, JOURNAL OF GRAPH THEORY, v.85, no.1, pp.172 - 186, 2017-05 |
Discover