✦ LIBER ✦

On f-factors of a graph

✍ Scribed by Jialong Lan; Wai-Kai Chen

Publisher: Elsevier Science
Year: 1985
Tongue: English
Weight: 404 KB
Volume: 320
Category: Article
ISSN: 0016-0032
DOI: 10.1016/0016-0032(85)90027-4

No coin nor oath required. For personal study only.

✦ Synopsis

This paper probes the relations between f-factors and subgraphs and their degree sequences in a graph when the graph has the odd-cycle property and contains no self-loop. Useful results are derived which greatly simplify tests of the existence of f-factors.

z. zntrodactic?n

📜 SIMILAR VOLUMES

A note on the f-factor-lattice of bipart

A note on the f-factor-lattice of bipartite graphs

✍ J Rieder 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 406 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

On 2-factors of a bipartite graph

✍ Wang, Hong 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 191 KB 👁 2 views

In this article, we consider the following problem: Given a bipartite graph G and a positive integer k, when does G have a 2-factor with exactly k components? We will prove that if , then, for any bipartite graph H = (U 1 , U 2 ; F ) with |U 1 | ≤ n, |U 2 | ≤ n and ∆(H) ≤ 2, G contains a subgraph i

A Characterization of Graphs Having All

A Characterization of Graphs Having All (g, f)-Factors

✍ Thomas Niessen 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 310 KB

Let G be a graph with vertex set V and let g, f : V Ä Z + . We say that G has all ( g, f )-factors if G has an h-factor for every h: V Ä Z + such that g(v) h(v) f (v) for every v # V and at least one such h exists. In this note, we derive from Tutte's f-factor theorem a similar characterization for

A note concerning graphs with unique f-f

A note concerning graphs with unique f-factors

✍ Bill Jackson; R. W. Whitty 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 74 KB

We show that if a 2-edge connected graph G has a unique f-factor F, then some vertex has the same degree in F as in G. This conclusion is the best possible, even if the hypothesis is considerably strengthened. 1. All graphs considered are finite but may contain loops and multiple edges. Let G be a

Binding numbers and f-factors of graphs

✍ Mikio Kano; Norihide Tokushige 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 351 KB