๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The number of triangular packings of a vertex labelled graph on a torus

โœ Scribed by S. A. Larenchenko

Publisher
Springer US
Year
1991
Tongue
English
Weight
971 KB
Volume
54
Category
Article
ISSN
1573-8795

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Graphs on the Torus and Geometry of Numb
Graphs on the Torus and Geometry of Numbers
โœ A. Schrijver ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 424 KB

We show that if \(G\) is a graph embedded on the torus \(S\) and each nonnullhomotopic closed curve on \(S\) intersects \(G\) at least \(r\) times, then \(G\) contains at least \(\left\lfloor\frac{3}{4} r\right\rfloor\) pairwise disjoint nonnullhomotopic circuits. The factor \(\frac{3}{4}\) is best

On labeled vertex-transitive digraphs wi
On labeled vertex-transitive digraphs with a prime number of vertices
โœ Chong-Yun Chao; Jacqueline G. Wells ๐Ÿ“‚ Article ๐Ÿ“… 1983 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 481 KB

## We enumerate, up to isomorphism, several classes of labeled vertex-transitive digraphs with a prime number of vertices. There are many unsolvedi enumeration problems stated in [S]. Recently, Robinson in [8] posed more enumeration problems. Here, we give some partial answer to the problems posed