𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Forbidden subgraphs and the existence of paths and cycles passing through specified vertices

✍ Scribed by Jun Fujisawa; Katsuhiro Ota; Takeshi Sugiyama; Masao Tsugaki

Book ID
108113959
Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
323 KB
Volume
308
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Heavy cycles passing through some specif
Heavy cycles passing through some specified vertices in weighted graphs
✍ Jun Fujisawa; Kiyoshi Yoshimoto; Shenggui Zhang πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 111 KB

## Abstract A weighted graph is one in which every edge __e__ is assigned a nonnegative number, called the weight of __e__. The sum of the weights of the edges incident with a vertex Ο… is called the weighted degree of Ο…. The weight of a cycle is defined as the sum of the weights of its edges. In th

Forbidden subgraphs and the existence of
Forbidden subgraphs and the existence of a 2-factor
✍ R. E. L. Aldred; Jun Fujisawa; Akira Saito πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 195 KB πŸ‘ 1 views

## Abstract In this paper, we consider forbidden subgraphs which force the existence of a 2‐factor. Let \documentclass{article}\footskip=0pc\pagestyle{empty}\begin{document}${\cal G}$\end{document} be the class of connected graphs of minimum degree at least two and maximum degree at least three, an

On the existence of specified cycles in
On the existence of specified cycles in a tournament
✍ Abdelhamid Benhocine; A. Pawel Wojda πŸ“‚ Article πŸ“… 1983 πŸ› John Wiley and Sons 🌐 English βš– 241 KB πŸ‘ 1 views

For 2 s p s n and n 2 3, D(n, p) denotes the digraph with n vertices obtained from a directed cycle of length n by changing the orientation of p -1 consecutives edges. In this paper, we prove that every tournament of order n 2 7 contains D(n, p ) for p = 2, 3, ..., n. Furthermore, we determine the t