35 citations · 100 across the 23 of their papers we have counts for
Showing 2012 · cs.DMShow all
3 papers · 2 filters
cs.DM2012★ 10 cited
A note on planar partial 3-trees
Jan Kratochvíl, Michal Vaner
It implicitly follows from the work of [Colbourn, El-Mallah: On two dual classes of planar graphs. Discrete Mathematics 80(1): 21-40 (1990)] that every planar partial 3-tree is a s…
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…
cs.DM2012★ 1 cited
A Kuratowski-Type Theorem for Planarity of Partially Embedded Graphs
Vít Jelínek, Jan Kratochvíl, Ignaz Rutter
A partially embedded graph (or PEG) is a triple (G,H,\H), where G is a graph, H is a subgraph of G, and \H is a planar embedding of H. We say that a PEG (G,H,\H) is planar if the g…