C. Hoàng

activity

20062026

most citedEdge Intersection Graphs of L-Shaped Paths in Grids

16 citations · 48 across the 24 of their papers we have counts for

collaborators

Showing 2014Show all

2 papers · 1 filter

cs.DM2014★ 5 cited

Polynomial-time algorithms for minimum weighted colorings of ( $P_{5}, P ˉ_{5}$ )-free graphs and related graph classes

Chính T. Hoàng, D. Adam Lazzarato

We design an $O (n^{3})$ algorithm to find a minimum weighted coloring of a ( $P_{5}, P ˉ_{5}$ )-free graph. Furthermore, the same technique can be used to solve the same problem for se…

math.CO2014★ 3 cited

On color-critical ( $P_{5}, P_{5}$ )-free graphs

Harjinder S. Dhaliwal, Angèle M. Hamel, Chính T. Hoàng +3

A graph is $k$ -critical if it is $k$ -chromatic but each of its proper induced subgraphs is ( $k - 1$ )-colorable. It is known that the number of $4$ -critical $P_{5}$ -free graphs is finit…

Polynomial-time algorithms for minimum weighted colorings of (P5​,Pˉ5​)-free graphs and related graph classes

On color-critical (P5​,P5​)-free graphs

Polynomial-time algorithms for minimum weighted colorings of ( $P_{5}, P ˉ_{5}$ )-free graphs and related graph classes

On color-critical ( $P_{5}, P_{5}$ )-free graphs