Route systems of a connected graph
The concept of a route system was introduced by the present author in [3].Route systems of a connected graph generalize the set of all shortest paths in . In this paper some properties of route systems are studied.
Route systems on graphs
The well known types of routes in graphs and directed graphs, such as walks, trails, paths, and induced paths, are characterized using axioms on vertex sequences. Thus non-graphic characterizations of the various types of routes are obtained.
Routing and timetabling by topological search.
R-S correspondence for and Klein-4 diagram algebras.
RSK bases and Kazhdan-Lusztig cells
From the combinatorial characterizations of the right, left, and two-sided Kazhdan-Lusztig cells of the symmetric group, “ RSK bases” are constructed for certain quotients by two-sided ideals of the group ring and the Hecke algebra. Applications to invariant theory, over various base rings, of the general linear group and representation theory, both ordinary and modular, of the symmetric group are discussed.
RSK insertion for set partitions and diagram algebras.
RWPRI and flag-transitive linear spaces.