35 citations · 100 across the 23 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2016
On the hardness of switching to a small number of edges
Vít Jelínek, Eva Jelínková, Jan Kratochvíl
Seidel's switching is a graph operation which makes a given vertex adjacent to precisely those vertices to which it was non-adjacent before, while keeping the rest of the graph unc…
cs.CC2012★ 8 cited
Extending Partial Representations of Subclasses of Chordal Graphs
Pavel Klavik, Jan Kratochvil, Yota Otachi +1
Chordal graphs are intersection graphs of subtrees of a tree T. We investigate the complexity of the partial representation extension problem for chordal graphs. A partial represen…