16 citations · 48 across the 24 of their papers we have counts for
Showing 2025 · math.COShow all
3 papers · 2 filters
math.CO2025
On the structure of perfectly divisible graphs
Chính T. Hoàng
A graph is perfectly divisible if every induced subgraph of contains a set of vertices such that meets all largest cliques of , and induces a perfect gra…
math.CO2025
On graphs without four-vertex induced subgraphs
Kathie Cameron, Chính T. Hoàng, Taite LaGrange
Given a family F of graphs, a graph G is F-free if it does not contain any graph in F as an induced subgraph. The problem of determining the complexity of colouring (claw, 4K1)- fr…
math.CO2025
On the structure of (dart, odd hole)-free graphs
Chính T. Hoàng
A hole is a chordless cycle with at least four vertices. A hole is odd if it has an odd number of vertices. A dart is a graph which vertices and edges $ab, bc, bd,…