35 citations · 53 across the 6 of their papers we have counts for
Showing cs.DMShow all
3 papers · 1 filter
cs.DM2014★ 12 cited
Irreversible 2-conversion set in graphs of bounded degree
Jan Kynčl, Bernard Lidický, Tomáš Vyskočil
An irreversible -threshold process (also a -neighbor bootstrap percolation) is a dynamic process on a graph where vertices change color from white to black if they have at le…
cs.DM2013
Extending Partial Representations of Interval Graphs
Pavel Klavík, Jan Kratochvíl, Yota Otachi +2
Interval graphs are intersection graphs of closed intervals of the real-line. The well-known computational problem, called recognition, asks whether an input graph can be repre…
cs.DM2012★ 3 cited
Extending Partial Representations of Proper and Unit Interval Graphs
Pavel Klavík, Jan Kratochvíl, Yota Otachi +4
The recently introduced problem of extending partial interval representations asks, for an interval graph with some intervals pre-drawn by the input, whether the partial representa…