✦ LIBER ✦

A simple existence criterion for (g < f)- factors

✍ Scribed by Katherine Heinrich; Pavol Hell; David G. Kirkpatrick; Guizhen Liu

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 312 KB
Volume: 85
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(90)90387-w

No coin nor oath required. For personal study only.

✦ Synopsis

We simplify the criterion of Lovasz for the existence of a (g, f)-factor when g <f, or when the graph is bipartite. Moreover, we give a simple direct proof, implying an O(m. IQ) algorithm, for these cases. We then illustrate the convenience of the new criterion by deriving some old and some new facts about (g,f)-factors and [a,b]-factors.

* We acknowledge NSERC support from grants A7829, A5075, and A3583.

📜 SIMILAR VOLUMES

Some conditions for the existence of f-f

Some conditions for the existence of f-factors

✍ P. Katerinis 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 268 KB 👁 1 views

Let m, 1, n be three odd integers such that m < I < n. It is proved that if a graph G has an mfactor and an rrfactor, then it also has an /factor. In addition, we obtain sufficient conditions for the existence of an f-factor, in terms of vertexdeleted subgraphs. All graphs considered here are multi

A criterion for F-subnormality

✍ K Doerk; M.D Pérez-Ramos 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 308 KB

Some applications of a simple criterion

Some applications of a simple criterion for the existence of periodic solutions of ordinary differential equations

✍ Ronald Becker; Giovanni Vidossich 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 438 KB

A simple crack-extension criterion for t

A simple crack-extension criterion for time-dependent spallation

✍ F.A. Field 📂 Article 📅 1971 🏛 Elsevier Science 🌐 English ⚖ 607 KB

Maximum (g,f)-factors of a general graph

✍ William Y.C. Chen 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 472 KB

Chen, W. Y. C., Maximum (g, f)-factors of a general graph, Discrete Mathematics 91 (1991) l-7. This paper presents a characterization of maximum (g, f)-factors of a general graph in which multiple edges and loops are allowed. An analogous characterization of the minimum (g,f)-factors of a general gr

Sufficient conditions for graphs to have

Sufficient conditions for graphs to have (g, f)-factors

✍ Yoshimi Egawa; Mikio Kano 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 170 KB

We give sufficient conditions for a graph to have a (g,f)-factor. For example, we prove that a graph G has a (g,f)-factor if g(v) < f(v) for all vertices v of G and g(x)/deg~(x) <~ f(y)/deg~(y) for all adjacent vertices x and y of G.