112 citations · 298 across the 40 of their papers we have counts for
Showing 2013 · cs.DMShow all
2 papers · 2 filters
cs.DM2013★ 2 cited
Drawing Permutations with Few Corners
Sergey Bereg, Alexander E. Holroyd, Lev Nachmanson +1
A permutation may be represented by a collection of paths in the plane. We consider a natural class of such representations, which we call tangles, in which the paths consist of st…
cs.DM2013
Threshold-Coloring and Unit-Cube Contact Representation of Graphs
Md. Jawaherul Alam, Steven Chaplick, Gašper Fijavž +3
In this paper we study threshold coloring of graphs, where the vertex colors represented by integers are used to describe any spanning subgraph of the given graph as follows. Pairs…