Reconstructing a Graph from the Incidence Relation on its Edge Set
Reconstructing equivalences
Reconstructing integer sets from their representation functions.
Reconstructing permutations from cycle minors.
Reconstructing subsets of reals.
Reconstructing Surface Triangulations by Their Intersection Matrices 26 September 2014
The intersection matrix of a simplicial complex has entries equal to the rank of the intersecction of its facets. We prove that this matrix is enough to define up to isomorphism a triangulation of a surface.
Reconstructing the n-Connected Components of a Graph
Reconstruction of a tree from certain maximal proper subtrees
Reconstruction of complete interval tournaments. II.
Reconstruction of graphs with certain degree-sequences.
Reconstruction of graphs with special degree-sequences
Reconstruction of partitions.
Records in set partitions.
Recouvrement et partition en chaînes des arêtes d'un graphe cubique
Recouvrements d'un rectangle de largeur 3 à l'aide de triminos
On établit une récurrence du 6-ième ordre pour le nombre de recouvrements d'un rectangle de largeur 3 et de longueur n à l'aide de «triminos». Des problèmes analogues peuvent se poser à propos de découpages électoraux.
Rectangle-visibility layouts of unions and products of trees.
Rectangular and trapezoidal arrangements.
Rectangular table negotiation problem revisited
We solve the last missing case of a “two delegation negotiation” version of the Oberwolfach problem, which can be stated as follows. Suppose we have two negotiating delegations with n=mk members each and we have a seating arrangement such that every day the negotiators sit at m tables with k people of the same delegation at one side of each table. Every person can effectively communicate just with three nearest persons across the table. Our goal is to guarantee that over the course of several days,...
Rectilinear Planar Layouts and Bipolar Orientations of Planar Graphs.
Rectilinear Shortest Paths in the Presence of Rectangular Barriers.