𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Ranking the vertices of a weighted digraph using the length of forward arcs

✍ Scribed by Mikio Kano; Akio Sakamoto

Publisher
John Wiley and Sons
Year
1983
Tongue
English
Weight
353 KB
Volume
13
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The number of vertices of degree k in a
The number of vertices of degree k in a minimally k-edge-connected digraph
✍ Yuan Xu-dong; Kang Liying; Cai Mao-cheng πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 298 KB πŸ‘ 2 views

Let k be a positive integer, and D = (V (D), E(D)) be a minimally k-edge-connected simple digraph. We denote the outdegree and indegree of x ∈ V (D) by δ D (x) and ρ D (x), respectively. Let u + (D) denote the number of vertices W. Mader asked the following question in [Mader, in Paul Erdâs is Eigh

Covering the vertices of a graph by cycl
Covering the vertices of a graph by cycles of prescribed length
✍ D. Amar; I. Fournier; A. Germa πŸ“‚ Article πŸ“… 1989 πŸ› John Wiley and Sons 🌐 English βš– 321 KB

The main theorem of that paper is the following: let G be a graph of order n, of size at least (nZ -3n + 6 ) / 2 . For any integers k, n,, n2,. . . , nk such that n = n, + n2 + ... + nk and n, 2 3, there exists a covering of the vertices of G by disjoint cycles (C,),=,..,k with ICjl = n,, except whe