𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A necessary condition for the existence of a circuit of any specified length

✍ Scribed by K. R. Gehner

Publisher
John Wiley and Sons
Year
1976
Tongue
English
Weight
332 KB
Volume
6
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

✦ Synopsis

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 Hamiltonian circuit in a planar graph.

πŸ“œ SIMILAR VOLUMES

A degree condition for the existence of
A degree condition for the existence of k-factors
✍ Tsuyoshi Nishimura πŸ“‚ Article πŸ“… 1992 πŸ› John Wiley and Sons 🌐 English βš– 358 KB πŸ‘ 1 views

## Abstract Let __k__ be an integer such that ≦, and let __G__ be a connected graph of order __n__ with ≦, __kn__ even, and minimum degree at least __k__. We prove that if __G__ satisfies max(deg(u), deg(v)) ≦ n/2 for each pair of nonadjacent vertices __u, v__ in __G__, then __G__ has a __k__‐facto

Sufficient and Necessary Condition for t
Sufficient and Necessary Condition for the Completeness of a Calculus
✍ H. AndrΓ©ka; T. Gergely; I. NΓ©meti πŸ“‚ Article πŸ“… 1974 πŸ› John Wiley and Sons 🌐 English βš– 140 KB πŸ‘ 1 views

I n this study we reformulate GODEL'S completeness theorem such that any firstorder calculus can be tested for completeness. The theorem in this form gives simple sufficient and necessary algebraic conditions for the calculus to be complete.

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