3 citations · 9 across the 5 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
cs.DM2016★ 1 cited
Chromatic number of ISK4-free graphs
Ngoc Khang Le
A graph is said to be ISK4-free if it does not contain any subdivision of as an induced subgraph. In this paper, we propose new upper bounds for chromatic number of ISK4-…
cs.DM2016★ 3 cited
On rank-width of even-hole-free graphs
Isolde Adler, Ngoc Khang Le, Haiko Müller +3
We present a class of (diamond, even hole)-free graphs with no clique cutset that has unbounded rank-width. In general, even-hole-free graphs have unbounded rank-width, because cho…