Chun-Hung Liu
Mailstop 3368
E-mail: chliu (at)
math (dot) tamu(dot) edu
Office:
I am an assistant
professor at Department of Mathematics
of Texas A&M University. Before joining
Texas A&M, I was an instructor at Department
of Mathematics of Princeton
University. I received my Ph.D. degree in the Algorithms, Combinatorics, and Optimization
(ACO) program at School of
Mathematics of Georgia Institute of
Technology under the supervision of Robin Thomas. The title of my
thesis is Graph
Structures and Well-quasi-ordering. Before I went to Georgia Tech, I got my
B.S and M.S. degree from Department of
Mathematics at National Taiwan University.
My research is
partially supported by NSF under grant No. DMS-1929851 and DMS-1954054.
Here you can find
my:
CV (latest
updated on Jul. 2, 2020)
Publication list
(latest updated on Jul. 2, 2020)
Teaching:
l
Spring
2020: MATH
689 Special Topics: Advanced Graph Theory.
Research
Interests:
Graph theory,
combinatorics, and algorithms.
Publications:
l
Immersion and clustered coloring, (submitted), arXiv:2007.00259.
l
A global decomposition theorem for
excluding immersions in graphs with no edge-cut of order three, (submitted), arXiv:2006.15694.
l
Robertson's
l
Notes on graph product structure theory (with Z. Dvorak, T. Huynh, G. Joret and D.
R. Wood), arXiv:2001.08860.
l
Phase transition of degeneracy in
minor-closed families
(with F. Wei), (submitted), arXiv:1912.02375.
l
Clustered coloring of graphs excluding a
subgraph (with D. R.
Wood), (submitted), arXiv:1905.08969.
l
A unified proof of conjectures on cycle
lengths in graphs (with J.
Gao, Q. Huo and J. Ma), (submitted), arXiv:1904.08126.
l
Packing topological minors half-integrally, (submitted), arXiv:1707.07221.
l
Packing and covering immersions in
4-edge-connected graphs,
(submitted), arXiv:1505.00867.
l
Recent progress on well-quasi-ordering
graphs, Well-Quasi Orders
in Computation, Logic, Language and Reasoning. Trends in Logic (Studia Logica
Library) 53 (2020), pp. 161-188.
l
Triangle-free graphs that do not contain an
induced subdivision of K_4 are 3-colorable (with M. Chudnovsky, O. Schaudt, S. Spirkl,
l
Excluding subdivisions of bounded degree
graphs (with R. Thomas),
J. Combin. Theory Ser. B 134 (2019), pp. 1-35.
l
Size of the largest induced forest in
subcubic graphs of girth at least four and five (with T. Kelly), J. Graph Theory 89 (2018), pp.
457-478.
l
Characterization of cycle obstruction sets
for improper coloring planar graphs (with I. Choi and
l
Domination in tournaments (with M. Chudnovsky, R. Kim, P. Seymour,
and
l
Partitioning H-minor free graphs into three
subgraphs with no large components (with
l
Cycle lengths and minimum degree of graphs (with J. Ma), J. Combin. Theory Ser. B 128
(2018), pp. 66-95.
l
On the minimum edge-density of 4-critical
graphs of girth five (with
L. Postle), J. Graph Theory 86 (2017), pp. 387-405.
l
Minimum size of feedback vertex sets of
planar graphs of girth at least five (with T. Kelly), European J. Combin. 61 (2017), pp.
138-150.
l
Edge Roman domination on graphs (with G. J. Chang and S.-H. Chen), Graphs
Combin. 32 (2016), pp. 1731-1747.
l
Deploying robots with two sensors in
K_{1,6}-free graphs (with
l
An upper bound on the fractional chromatic
number of triangle-free subcubic graphs, SIAM J. Discrete Math. 28 (2014), pp. 1102-1136.
l
Linear colorings of subcubic graphs (with G. Yu), European J. Combin. 34
(2013), pp. 1040-1050
l
A new bound for the 2/3 conjecture (with D. Král', J.-S. Sereni, P. Whalen,
and Z. Yilma), Combin. Probab. Comput. 22 (2013), pp. 384-393
l
Roman domination on strongly chordal graphs (with G. J. Chang), J. Comb. Optim. 26
(2013), pp. 608-619
l
Trees with strong equality between the
Roman domination number and the unique response Roman domination number (with N. Jafari Rad), Australas. J.
Combin. 54 (2012), pp. 133-140
l
Upper bounds on Roman domination numbers of
graphs (with G. J. Chang),
Discrete Math. 312 (2012), pp. 1386-1391
l
Roman domination on 2-connected graphs (with G. J. Chang), SIAM J. Discrete Math.
26 (2012), pp. 193-205