𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A sufficient condition for a graph to be weakly k-linked

✍ Scribed by Tomio Hirata; Kiyohito Kubota; Osami Saito

Book ID
107884192
Publisher
Elsevier Science
Year
1984
Tongue
English
Weight
446 KB
Volume
36
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A sufficient condition for a regular gra
A sufficient condition for a regular graph to be class 1
✍ A. J. W. Hilton; Cheng Zhao πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 553 KB

## Abstract The core __G__Ξ” of a simple graph __G__ is the subgraph induced by the vertices of maximum degree. It is well known that the Petersen graph is not 1‐factorizable and has property that the core of the graph obtained from it by removing one vertex has maximum degree 2. In this paper, we p

A sufficient condition for graphs to be
A sufficient condition for graphs to be fractional -deleted graphs
✍ Sizhong Zhou πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 218 KB

graph a b s t r a c t Let G be a graph, and k a positive integer. Let h : E(G) β†’ [0, 1] be a function. If βˆ‘ eβˆ‹x h(e) = k holds for each x ∈ V (G), then we call G[F h ] a fractional k-factor of G with indicator function h where F h = {e ∈ E(G) : h(e) > 0}. A graph G is called a fractional (k, m)delet