Chı́nh T. Hoàng

1. Deciding k-colourability of P₅-free graphs in polynomial time
   2007/02/07 by Chı́nh T. Hoàng, Hoàng, Chính T., Marcin Kamiński +7 · 3 citations
   Computer Science · Mathematics · #Advanced Graph Theory Research #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #G.2.2 #Graph Labeling and Dimension Problems #Limits and Structures in Graph Theory
2. Hamiltonian degree conditions for tough graphs
   1995/07/01 by Chinh T. Hoàng, Chı́nh T. Hoàng · 3 citations
   Computer Science · Mathematics · #Advanced Graph Theory Research #Graph theory and applications #Limits and Structures in Graph Theory
3. On graphs without a C4 or a diamond
   2009/09/25 by Elaine M. Eschen, Chı́nh T. Hoàng, Eschen, Elaine M. +5 · 1 citation
   Computer Science · Mathematics · #Graph Labeling and Dimension Problems #Limits and Structures in Graph Theory #Advanced Graph Theory Research
4. Infinite families of k-vertex-critical (P₅, C₅)-free graphs
   2023/06/06 by Ben Cameron, Chı́nh T. Hoàng, Cameron, Ben +1 · 1 citation
   Mathematics · Computer Science · #Graph theory and applications #Advanced Graph Theory Research #Limits and Structures in Graph Theory