𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Existence of openly disjoint circuits through a vertex

✍ Scribed by W. Mader

Publisher
John Wiley and Sons
Year
2010
Tongue
English
Weight
131 KB
Volume
63
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

We deal with conditions for a digraph of minimum degree r which imply the existence of a vertex x contained in r circuits which have pairwise only x in common. In particular, we give some positive answers to a question of P. Seymour, whether an r‐regular digraph has a vertex x which is contained in r circuits pairwise disjoint except for x, and show that the answer, in general, is negative. Β© 2009 Wiley Periodicals, Inc. J Graph Theory 63: 93–105, 2010

πŸ“œ SIMILAR VOLUMES

Vertex-disjoint cycles of length at most
Vertex-disjoint cycles of length at most four each of which contains a specified vertex
✍ Yoshiyas Ishigami πŸ“‚ Article πŸ“… 2001 πŸ› John Wiley and Sons 🌐 English βš– 157 KB

## Abstract We obtain a sharp minimum degree condition Ξ΄ (G) β‰₯ $\lfloor {\sqrt {\phantom{n^2}n+k^2-3k+1}}\rfloor + 2k-1$ of a graph __G__ of order __n__ β‰₯ 3__k__ guaranteeing that, for any __k__ distinct vertices, __G__ contains __k__ vertex‐disjoint cycles of length at most four each of which cont

A necessary condition for the existence
A necessary condition for the existence of a circuit of any specified length
✍ K. R. Gehner πŸ“‚ Article πŸ“… 1976 πŸ› John Wiley and Sons 🌐 English βš– 332 KB

## Abstract A necessary condition for the existence of a circuit of any specified length in a connected planar graph is developed and several applications of this result are given. This necessary condition is a direct generalization of the Kosyrev‐Grinberg condition for the existence of a Hamiltoni