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

Note on alternating directed cycles

โœ Scribed by Gregory Gutin; Benjamin Sudakov; Anders Yeo

Book ID
108316262
Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
331 KB
Volume
191
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A Note on Alternating Cycles in Edge-Col
A Note on Alternating Cycles in Edge-Coloured Graphs
โœ Anders Yeo ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 431 KB

Grossman and Ha ggkvist gave a sufficient condition under which a two-edgecoloured graph must have an alternating cycle (i.e., a cycle in which no two consecutive edges have the same colour). We extend their result to edge-coloured graphs with any number of colours. That is, we show that if there is

On cycles of directed graphs
On cycles of directed graphs
โœ Z. ร‰sik ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› Springer Netherlands ๐ŸŒ English โš– 287 KB
A note on distance-dominating cycles
A note on distance-dominating cycles
โœ P. Fraisse ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 396 KB

Nous prouvons une conjecture due & Bondy et Fan. Un cycle C d'un graphe G est dit m-dominant si tout sommet de V(G -C) est a distance au plus m de C. Notre r&t&at est: si G est k-connexe, et si G n'a pas de cycle m-dominant, alors il existe un stable de cardinal k + 1, dont les sommets sont deux 3 d

A note on odd/even cycles
A note on odd/even cycles
โœ Anna Lubiw ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 397 KB
Note on the existence of directed (k + 1
Note on the existence of directed (k + 1)-cycles in diconnected complete k-partite digraphs
โœ R. Balakrishnan; P. Paulraja ๐Ÿ“‚ Article ๐Ÿ“… 1984 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 150 KB ๐Ÿ‘ 1 views

A graph is constructed to provide a negative answer to the following question of Bondy: Does every diconnected orientation of a complete k-partite (k 2 5) graph with each part of size at least 2 yield a directed (k + 1)-cycle?