Liu, Chun-Hung Assistant Professor

academic article

• Chudnovsky, M., Liu, C., Schaudt, O., Spirkl, S., Trotignon, N., & Vušković, K. (2019). Triangle‐free graphs that do not contain an induced subdivision of K4 are 3‐colorable. Journal of Graph Theory.  92(2), 67-95.
  
• Liu, C., & Thomas, R. (2019). Excluding subdivisions of bounded degree graphs. Journal of Combinatorial Theory Series B.  134, 1-35.
  
• Kelly, T., & Liu, C. (2018). Size of the largest induced forest in subcubic graphs of girth at least four and five. Journal of Graph Theory.  89(4), 457-478.
  
• Chudnovsky, M., Kim, R., Liu, C., Seymour, P., & Thomassé, S. (2018). Domination in tournaments. Journal of Combinatorial Theory Series B.  130, 98-113.
  
• Choi, I., Liu, C., & Oum, S. (2018). Characterization of Cycle Obstruction Sets for Improper Coloring Planar Graphs. FPSAC'10 - 22nd International Conference on Formal Power Series and Algebraic Combinatorics.  32(2), 1209-1228.
  
• Liu, C., & Ma, J. (2018). Cycle lengths and minimum degree of graphs. Journal of Combinatorial Theory Series B.  128, 66-95.
  
• Liu, C., & Oum, S. (2018). Partitioning H-minor free graphs into three subgraphs with no large components. Journal of Combinatorial Theory Series B.  128, 114-133.
  
• Liu, C., & Postle, L. (2017). On the Minimum Edge‐Density of 4‐Critical Graphs of Girth Five. Journal of Graph Theory.  86(4), 387-405.
  
• Kelly, T., & Liu, C. (2017). Minimum size of feedback vertex sets of planar graphs of girth at least five. European Journal of Combinatorics.  61, 138-150.
  
• Chang, G. J., Chen, S., & Liu, C. (2016). Edge Roman Domination on Graphs. Graphs and Combinatorics.  32(5), 1731-1747.
  
• Abbas, W., Egerstedt, M., Liu, C., Thomas, R., & Whalen, P. (2016). Deploying Robots With Two Sensors in K1, 6‐Free Graphs. Journal of Graph Theory.  82(3), 236-252.
  
• Liu, C., & Oum, S. (2015). Partitioning H-minor free graphs into three subgraphs with no large components. Electronic Notes in Discrete Mathematics.  49, 133-138.
  
• Liu, C. (2014). An Upper Bound on the Fractional Chromatic Number of Triangle-Free Subcubic Graphs. FPSAC'10 - 22nd International Conference on Formal Power Series and Algebraic Combinatorics.  28(3), 1102-1136.
  
• Liu, C., & Chang, G. J. (2013). Roman domination on strongly chordal graphs. Journal of Combinatorial Optimization.  26(3), 608-619.
  
• Liu, C., & Yu, G. (2013). Linear colorings of subcubic graphs. European Journal of Combinatorics.  34(6), 1040-1050.
  
• KRÁL', D., LIU, C., SERENI, J., WHALEN, P., & YILMA, Z. B. (2013). A New Bound for the 2/3 Conjecture †. Combinatorics Probability Computing.  22(3), 384-393.
  
• Rad, N. J., & Liu, C. H. (2012). Trees with strong equality between the Roman domination number and the unique response Roman domination number. Australasian Journal of Combinatorics.  54(2), 133-140.
  
• Liu, C., & Chang, G. J. (2012). Upper bounds on Roman domination numbers of graphs. Discrete Mathematics.  312(7), 1386-1391.
  
• Liu, C., & Chang, G. J. (2012). Roman Domination on 2-Connected Graphs. FPSAC'10 - 22nd International Conference on Formal Power Series and Algebraic Combinatorics.  26(1), 193-205.