Randomly complete -partite graphs
Recherche des graphes des matrices de Coxeter hyperboliques d’ordre
Reconstructing a Graph from the Incidence Relation on its Edge Set
Reconstruction of a tree from certain maximal proper subtrees
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.
Reduction and irreducibility for words and tree-words
Regular Graphs, Each Edge of Which Belongs to Exactly One -Gon
Regular societies without short cycles
Relationships between distance domination parameters.
Relative expressiveness of the edge/adjacency language for graph theory
Reliability of communication networks with delay constraints: computational complexity and complete topologies.
Remarks on dimensions of graphs
Remarks on regular factors of regular graphs
Representation of semigroups by products of simple graphs
Representation of the finite directed acyclic graph
Representation of undirected graphs by anticommutative conservative groupoids
The paper studies tolerances and congruences on anticommutative conservative groupoids. These groupoids can be assigned in a one-to-one way to undirected graphs.
Representing graphs by means of strong and weak products
Riga -point
Rigidity and the lower bound Theorem l.