Chun-Hung Liu
Mailstop 3368
College Station,
TX 77843-3368
USA
E-mail: chliu (at)
math (dot) tamu(dot) edu
Office: Blocker
Building 631B
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.
Here you can find
my:
CV (latest
updated on Aug. 31, 2019)
Publication list
(latest updated on Aug. 31, 2019)
Teaching:
l
Fall
2019: MATH
613 Graph Theory.
Research
Interests:
Graph theory,
combinatorics, and algorithms.
Publications:
l
Clustered variants of Hajos' conjecture (with D. R. Wood), (submitted),
arXiv:1908.05597.
l
Phase transition of degeneracy in
minor-closed families
(with F. Wei), (submitted).
l
Clustered coloring of graphs excluding a
subgraph and a minor (with
D. R. Wood), (submitted), arXiv:1905.09495.
l
Clustered graph coloring and layered
treewidth (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
Recent progress on well-quasi-ordering
graphs, (submitted).
l
Packing and covering immersions in
4-edge-connected graphs,
(submitted), arXiv:1505.00867.
l
Triangle-free graphs that do not contain an
induced subdivision of K_4 are 3-colorable (with M. Chudnovsky, O. Schaudt, S. Spirkl, N.
Trotignon, and K. Vuskovic), J. Graph Theory 92 (2019), pp.67-95.
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 S. Oum), SIAM J. Discrete Math. 32
(2018), pp. 1209-1228.
l
Domination in tournaments (with M. Chudnovsky, R. Kim, P. Seymour,
and S. Thomasse), J. Combin. Theory Ser. B 130 (2018), pp. 98-113.
l
Partitioning H-minor free graphs into three
subgraphs with no large components (with S. Oum), J. Combin. Theory Ser. B 128 (2018), pp. 114-133.
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
W. Abbas, M. Egerstedt, R. Thomas, P. Whalen), J. Graph Theory 82 (2016), pp.
236-252.
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