The following pages link to Ilkyoo Choi (Q400410):
Displaying 50 items.
- Vertex arboricity of toroidal graphs with a forbidden cycle (Q400411) (← links)
- Equicovering subgraphs of graphs and hypergraphs (Q405168) (← links)
- Planar graphs with girth at least 5 are \((3, 5)\)-colorable (Q488297) (← links)
- Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors (Q505914) (← links)
- Avoiding large squares in partial words (Q551207) (← links)
- Inducibility of directed paths (Q785814) (← links)
- The layer number of \(\alpha \)-evenly distributed point sets (Q785830) (← links)
- The difference and ratio of the fractional matching number and the matching number of graphs (Q906487) (← links)
- 3-coloring triangle-free planar graphs with a precolored 9-cycle (Q1678087) (← links)
- On tiling the integers with 4-sets of the same gap sequence (Q1699536) (← links)
- Characterization of forbidden subgraphs for bounded star chromatic number (Q1712503) (← links)
- Locating a robber on a graph via distance queries (Q1929218) (← links)
- Largest 2-regular subgraphs in 3-regular graphs (Q2000571) (← links)
- Generalized list colouring of graphs (Q2053679) (← links)
- Planar graphs without pairwise adjacent 3-, 4-, 5-, and 6-cycle are 4-choosable (Q2078245) (← links)
- Improvements on Hippchen's conjecture (Q2166288) (← links)
- A sharp Ore-type condition for a connected graph with no induced star to have a Hamiltonian path (Q2181227) (← links)
- Partitioning sparse graphs into an independent set and a graph with bounded size components (Q2185923) (← links)
- Maximum \(k\)-sum \(\mathbf{n}\)-free sets of the 2-dimensional integer lattice (Q2205110) (← links)
- Partitioning planar graphs without 4-cycles and 5-cycles into bounded degree forests (Q2219964) (← links)
- On induced saturation for paths (Q2225408) (← links)
- Flexibility of planar graphs -- sharpening the tools to get lists of size four (Q2243143) (← links)
- A Ramsey-type theorem for the matching number regarding connected graphs (Q2279970) (← links)
- Collapsibility of non-cover complexes of graphs (Q2290346) (← links)
- List \(r\)-dynamic coloring of sparse graphs (Q2309401) (← links)
- The number of edges in induced subgraphs of some distance graphs (Q2314127) (← links)
- Planar graphs with girth at least 5 are \((3, 4)\)-colorable (Q2329168) (← links)
- Strong edge-colorings of sparse graphs with large maximum degree (Q2408965) (← links)
- On operations preserving semi-transitive orientability of graphs (Q2424730) (← links)
- On star 5-colorings of sparse graphs (Q2656970) (← links)
- Degeneracy and colorings of squares of planar graphs without 4-cycles (Q2658379) (← links)
- Brick partition problems in three dimensions (Q2659202) (← links)
- Odd coloring of sparse graphs and planar graphs (Q2689480) (← links)
- On choosability with separation of planar graphs with forbidden cycles (Q2800544) (← links)
- 3-Coloring Triangle-Free Planar Graphs with a Precolored 9-Cycle (Q2946045) (← links)
- (1,<i>k</i>)-Coloring of Graphs with Girth at Least Five on a Surface (Q2978189) (← links)
- Characterization of Cycle Obstruction Sets for Improper Coloring Planar Graphs (Q4564884) (← links)
- Online Ramsey theory for a triangle on ‐free graphs (Q5241610) (← links)
- Toroidal graphs containing neither nor 6‐cycles are 4‐choosable (Q5272640) (← links)
- Improper coloring of graphs on surfaces (Q5379836) (← links)
- On independent domination of regular graphs (Q6047642) (← links)
- The strong clique index of a graph with forbidden cycles (Q6056786) (← links)
- Decomposing planar graphs into graphs with degree restrictions (Q6081583) (← links)
- The list version of the Borodin-Kostochka conjecture for graphs with large maximum degree (Q6091818) (← links)
- A tight bound for independent domination of cubic graphs without 4‐cycles (Q6094034) (← links)
- Odd coloring of sparse graphs and planar graphs (Q6391902) (← links)
- Brooks-type theorems for relaxations of square colorings (Q6508799) (← links)
- Relaxation of Wegner's planar graph conjecture for maximum degree 4 (Q6611072) (← links)
- Brooks-type theorems for relaxations of square colorings (Q6635100) (← links)
- Proper conflict-free coloring of sparse graphs (Q6657259) (← links)
