✦ LIBER ✦

More sufficient conditions for a graph to have factors

✍ Scribed by R.P. Anstee; Yunsun Nam

Publisher: Elsevier Science
Year: 1998
Tongue: English
Weight: 459 KB
Volume: 184
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(97)00158-1

No coin nor oath required. For personal study only.

✦ Synopsis

This paper explores the problem of finding degree constrained subgraphs (i.e. (g, f)-factors) of a given graph using fractional subgraphs as a basis. These fractional subgraphs are often easy to obtain by heuristics. We apply our results to generalize results of Kano, Bermond and Las Vergnas among others and extend the possibilities for included (or forced) edges and excluded edges. ~

📜 SIMILAR VOLUMES

Sufficient conditions for a graph to hav

Sufficient conditions for a graph to have factors

✍ Mikio Kano 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 457 KB

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.

A sufficient condition for a bipartite g

A sufficient condition for a bipartite graph to have a k-factor

✍ Hikoe Enomoto; Katsuhiro Ota; Mikio Kano 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 308 KB 👁 1 views

A Sufficient Condition for a Graph to Ha

A Sufficient Condition for a Graph to Have a k-tree

✍ Aung Kyaw 📂 Article 📅 2001 🏛 Springer Japan 🌐 English ⚖ 107 KB

Sufficient conditions for a graph to be

Sufficient conditions for a graph to be Hamiltonian

✍ S Goodman; S Hedetniemi 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 330 KB

A sufficient condition for a graph to co

A sufficient condition for a graph to contain three disjoint 1-factors

✍ Sein Win 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 219 KB 👁 1 views

## Abstract Ore derived a sufficient condition for a graph to contain a Hamiltonian cycle. We obtain a sufficient condition, similar to Ore's condition, for a graph to contain a Hamiltonian cycle and a 1‐factor which are edge disjoint.