O-joung Kwon (권오정)

Department of Mathematics
Hanyang University

Graph theory · Combinatorics

Courses

Teaching

(Spring 2026)

  • Combinatorial mathematics
  • Abstract algebra I

(Fall 2025)

  • Number theory
  • Abstract algebra II
  • Graduate algorithms (parameterized complexity)

(Spring 2025)

  • Combinatorial mathematics
  • Abstract algebra I

(Fall 2024)

  • Graduate graph theory
    – Tree-depth, tree-width
    – Bouned expansion class, nowhere dense class
    – Degeneracy, weak coloring number, strong coloring number, admissibility
    – Constant approximation algorithm for dominating set and independent set
    – Low tree-depth colorings
    – First-order model checking
    – Layered treewidth and row treewidth
    – Rank-width, Rank-depth
    – Low rank-width/rank-depth colorings, Flip-width
  • Applications of graph theory (IC-PBL)

(Spring 2024)

  • Graduate algebra
  • Graph theory
    – Connectivity, Menger theorem
    – Matching, Tutte perfect matching theorem, Erdos-Posa theorem
    – Planar graphs, Kuratowski theorem
    – Graph coloring, Perfect graphs, Chi-bounded classes
    – Extremal graph theory, Random graphs
    – Ramsey theory
    – Tree decompositions and graph algorithms

(Fall 2023)

  • Abstract algebra II
  • Applications of graph algorithms (IC-PBL)

(Spring 2023)

  • Abstract algebra I
  • Graph theory

(Fall 2022)

  • Applications of graph algorithms (IC-PBL )

(Spring 2022)

  • Number theory
  • Abstract algebra for graduate students

(Fall 2021)

  • Topics in combinatorial analysis (graduate course)
  • Abstract algebra II (A first course in Abstract algebra, 7th edition)
  • Calculus II

(Spring 2021)

  • Combinatorics and graph theory (Textbook : An invitation to discrete mathematics, 2th edition)
  • Abstract algebra I (A first course in Abstract algebra, 7th edition)
  • Vector calculus

(Fall 2020)

  • Graph theory for graduate students
  • Calculus II
  • Elementary optimization (topics mainly include Linear programming, basic algorithms, and coding in python)

(Spring 2020)

  • Combinatorics and graph theory (Textbook : An invitation to discrete mathematics, 2th edition)
  • Abstract algebra I (A first course in Abstract algebra, 7th edition)
  • Calculus I

(Fall 2019)

  • Combinatorics and graph theory (Textbook : An invitation to discrete mathematics, 2th edition)
  • Abstract algebra II (A first course in Abstract algebra, 7th edition)
  • Calculus II

(Spring 2019)

  • Combinatorics and graph theory (Textbook : An invitation to discrete mathematics, 2th edition)
  • Abstract algebra I (A first course in Abstract algebra, 7th edition)
  • Mathematical programming (Textbook : Algorithms (Sanjoy Dasgupta, Christos Papadimitriou, Umesh Vazirani))

(Fall 2018)

  • Combinatorics and graph theory (Textbook : An invitation to discrete mathematics, 2th edition)

(Spring 2018)

  • Combinatorial Optimization (Textbook : Graphs, networks, and algorithms 4th edition – Dieter Jungnickel)
  • Number Theory (Textbook : Elementary number theory 7th edition – David M. Burton)