Recurrence of distributional limits of finite planar graphs.
Recurrent and transient trees. (Rekurrente und transiente Bäume.)
Recursive algorithm for parity games requires exponential time
This paper presents a new lower bound for the recursive algorithm for solving parity games which is induced by the constructive proof of memoryless determinacy by Zielonka. We outline a family of games of linear size on which the algorithm requires exponential time.
Recursive algorithm for parity games requires exponential time
This paper presents a new lower bound for the recursive algorithm for solving parity games which is induced by the constructive proof of memoryless determinacy by Zielonka. We outline a family of games of linear size on which the algorithm requires exponential time.
Recursive generation of -ary trees.
Recursive generation of simple planar quadrangulations with vertices of degree 3 and 4
We describe how the simple planar quadrangulations with vertices of degree 3 and 4, whose duals are known as octahedrites, can all be obtained from an elementary family of starting graphs by repeatedly applying two expansion operations. This allows for construction of a linear time generator of all graphs in the class with at most a given order, up to isomorphism.
Reducible properties of graphs
Let L be the set of all hereditary and additive properties of graphs. For P₁, P₂ ∈ L, the reducible property R = P₁∘P₂ is defined as follows: G ∈ R if and only if there is a partition V(G) = V₁∪ V₂ of the vertex set of G such that and . The aim of this paper is to investigate the structure of the reducible properties of graphs with emphasis on the uniqueness of the decomposition of a reducible property into irreducible ones.
Reducing the adjacency matrix of a tree.
Reduction and irreducibility for words and tree-words
Réductions de graphes et systèmes de Church-Rosser
Refined inertially and spectrally arbitrary zero-nonzero patterns.
Regular elements of the semigroup of all binary relations.
Regular factors in powers of connected graphs
Regular factors of regular graphs from eigenvalues.
Regular graphs containing a given graph.
Regular Graphs, Each Edge of Which Belongs to Exactly One -Gon
Regular societies without short cycles
Regular spanning subgraphs of bipartite graphs of high minimum degree.
Regularity and transitivity of local-automorphism semigroups of locally finite forests
Relating different cycle spaces of the same infinite graph.