1 citations · 2 across the 2 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2016★ 1 cited
Structure and algorithms for (cap, even hole)-free graphs
Kathie Cameron, Murilo V. G. da Silva, Shenwei Huang +1
A graph is even-hole-free if it has no induced even cycles of length 4 or more. A cap is a cycle of length at least 5 with exactly one chord and that chord creates a triangle with…
cs.DM2015★ 1 cited
A note on coloring (even-hole,cap)-free graphs
Shenwei Huang, Murilo V. G. da Silva
A {\em hole} is a chordless cycle of length at least four. A hole is {\em even} (resp. {\em odd}) if it contains an even (resp. odd) number of vertices. A \emph{cap} is a graph ind…