𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Degree Conditions for Graphs to be Fractional (a,b,n)-Critical Graphs

✍ Scribed by Jianxiang Li; Yinghong Ma

Book ID
107346976
Publisher
Academy of Mathematics and Systems Science, Chinese Academy of Sciences
Year
2006
Tongue
English
Weight
166 KB
Volume
19
Category
Article
ISSN
1009-6124

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

Ore-type degree conditions for a graph t
Ore-type degree conditions for a graph to be H-linked
✍ Alexandr V. Kostochka; Gexin Yu πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 155 KB πŸ‘ 1 views

## Abstract Given a fixed multigraph __H__ with __V__(__H__) = {__h__~1~,…, __h__~m~}, we say that a graph __G__ is __H__‐linked if for every choice of __m__ vertices __v__~1~, …, ~v~~m~ in __G__, there exists a subdivision of __H__ in __G__ such that for every __i__, __v__~i~ is the branch vertex

A degree condition for a graph to have [
A degree condition for a graph to have [a,b]-factors
✍ Li, Yanjun; Mao-cheng, Cai πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 131 KB πŸ‘ 2 views

Let G be a graph of order n, and let a and b be integers such that a+b for any two nonadjacent vertices u and v in G. This result is best possible, and it is an extension of T. Iida and T. Nishimura's results (T. Iida and T. Nishimura, An Ore-type condition for the existence of k-factors in graphs,