Hongyang Wang

Preprints

• Coloring P₆-free graphs with Δ − 1 colors
  ResearchGate · PDF
• Degree-list Kempe equivalence for 3-connected graphs
  Hongyang Wang
  2026. arXiv:2610.35701 · PDF
• Optimal K_t-free list colorings and the Pollyanna property of graphs with no triangular wheel
  Hongyang Wang and Rong Wu
  2026. arXiv:2610.35225 · PDF
• Partition-selected flow polynomials and associated arrangements
  Beifang Chen, Ying Cao, Houshan Fu, and Hongyang Wang
  2026. arXiv:2606.12861 · PDF
• Optimal chromatic bound for (P₂ ∪ P₄, HVN)-free graphs
  Lizhong Chen and Hongyang Wang
  2025. arXiv:2511.14507 · PDF
• Colouring (P₂ ∪ P₄, diamond)-free graphs with ω colours
  Hongyang Wang
  2025. arXiv:2511.13128 · PDF
• Perfect divisions in (P₂ ∪ P₄, bull)-free graphs
  Lizhong Chen and Hongyang Wang
  2025. arXiv:2507.18506 · PDF

Publications

• Complex unit gain graphs with rank 2n(G) − 2α(G) − 2c(G) + 1
  ScienceDirect
• On the chromatic number of graphs of odd girth without longer odd holes
  Hongyang Wang
  Discrete Applied Mathematics 342 (2024), 227–230. DOI