𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On monochromatic paths in m-coloured tournaments

✍ Scribed by Shen Minggang

Publisher
Elsevier Science
Year
1988
Tongue
English
Weight
194 KB
Volume
45
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On a problem of G. Hahn about coloured h
On a problem of G. Hahn about coloured hamiltonian paths in K2t
✍ M. Maamoun; H. Meyniel πŸ“‚ Article πŸ“… 1984 πŸ› Elsevier Science 🌐 English βš– 209 KB

We prove a theorem &wing that for every ir teger p (p a2) there is a good minirlal coloring of the edges alf JCzD such that every hamiltonian path in Kzp uses at least one colour twice. Tphis gives a counter-example tea a conjecture of Ha III [2).

Solution of a conjecture of Volkmann on
Solution of a conjecture of Volkmann on longest paths through an arc in strongly connected in-tournaments
✍ Dirk Meierling πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 139 KB πŸ‘ 1 views

## Abstract An in‐tournament is an oriented graph such that the negative neighborhood of every vertex induces a tournament. Let __m__ = 4 or __m__ = 5 and let __D__ be a strongly connected in‐tournament of order ${{n}}\geq {{2}}{{m}}-{{2}}$ such that each arc belongs to a directed path of order at

The visibility of coloured characters on
The visibility of coloured characters on coloured backgrounds in viewdata displays : Bruce, M., and Foster. J.J.Visible Language, 1982, 16.4, 382–390
πŸ“‚ Article πŸ“… 1984 πŸ› Elsevier Science 🌐 English βš– 152 KB

hand. Significantly more weight is lifted when higher-density materials are used. Comparison with the data collected on industrial subjects showed similar, but significantly different, frequency trends. Isometric shoulder strength appears to be the limiting factor in predicting maximum acceptable we