𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the realization of a (p,s)-digraph with prescribed degrees

✍ Scribed by Wai-Kai Chen

Book ID
107755047
Publisher
Elsevier Science
Year
1966
Tongue
English
Weight
863 KB
Volume
281
Category
Article
ISSN
0016-0032

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Realizability of p-point graphs with pre
Realizability of p-point graphs with prescribed minimum degree, maximum degree, and line connectivity
✍ F. T. Boesch; C. L. Suffel πŸ“‚ Article πŸ“… 1980 πŸ› John Wiley and Sons 🌐 English βš– 316 KB

## Abstract It is well known that certain graph‐theoretic extremal questions play a central role in the study of communication network vulnerability. Herein we consider a generalization of some of the classical results in this area. We define a (__p__, Ξ”, Ξ΄, Ξ») graph as a graph having __p__ points,

On the existence of a specified cycle in
On the existence of a specified cycle in digraphs with constraints on degrees
✍ Abdelhamid Benhocine πŸ“‚ Article πŸ“… 1984 πŸ› John Wiley and Sons 🌐 English βš– 326 KB πŸ‘ 1 views

We prove that Woodall's and GhouileHouri's conditions on degrees which ensure that a digraph is Hamiltonian, also ensure that it contains the analog of a directed Hamiltonian cycle but with one edge pointing the wrong way; that is, it contains two vertices that are connected in the same direction by