Browsing Combinatorics and Optimization by Author "Li, Yanjia"

Now showing items 1-2 of 2

Coloring Algorithms for Graphs and Hypergraphs with Forbidden Substructures

Li, Yanjia (University of Waterloo, 2022-04-18)

This thesis mainly focus on complexity results of the generalized version of the $r$-Coloring Problem, the $r$-Pre-Coloring Extension Problem and the List $r$-Coloring Problem restricted to hypergraphs and ordered graphs ...
Complexity Dichotomy for List-5-Coloring with a Forbidden Induced Subgraph

Hajebi, Sepehr; Li, Yanjia; Spirkl, Sophie (Society for Industrial and Applied Mathematics, 2022-08-30)

For a positive integer r and graphs G and H, we denote by G+H the disjoint union of G and H and by rH the union of r mutually disjoint copies of H. Also, we say G is H-free if H is not isomorphic to an induced subgraph of ...