16 citations · 48 across the 24 of their papers we have counts for
30 papers
Structural description of (bull, house)-free graphs
Manoj Belavadi, Chinh T. Hoang
The bull is a graph consisting of a triangle and two pendant edges. The P_5 is the chordless path on five vertices. The house is the complement of a P_5. A graph is k-critical if i…
On the structure of (, , )-free graphs
Chính T. Hoàng, Ramin Javadi, Nicolas Trotignon
Determining the complexity of colouring ()-free graph is a long open problem. Recently Penev showed that there is a polynomial-time algorithm to colour a ($4K_1, C_4, C_…
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…
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…
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,…
Infinite families of -vertex-critical (, )-free graphs
Ben Cameron, Chính T. Hoàng
A graph is -vertex-critical if but for all . We construct a new infinite families of -vertex-critical -free graphs for all .…