✦ LIBER ✦

A characterization of a graph which has a 2-factor

✍ Scribed by Y. Abe

Book ID: 104349080
Publisher: Elsevier Science
Year: 2000
Tongue: English
Weight: 234 KB
Volume: 13
Category: Article
ISSN: 0893-9659
DOI: 10.1016/s0893-9659(00)00069-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Domination in a graph with a 2-factor

✍ Ken-ichi Kawarabayashi; Michael D. Plummer; Akira Saito 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 77 KB

## Abstract Let γ(__G__) be the domination number of a graph __G__. Reed 6 proved that every graph __G__ of minimum degree at least three satisfies γ(__G__) ≤ (3/8)|__G__|, and conjectured that a better upper bound can be obtained for cubic graphs. In this paper, we prove that a 2‐edge‐connected cu

A Characterization of Graphs without Eve

A Characterization of Graphs without Even Factors

✍ Xueliang Li; Zhao Zhang 📂 Article 📅 2006 🏛 Springer Japan 🌐 English ⚖ 95 KB

A characterization of graphs which can b

A characterization of graphs which can be approximated in area by smooth graphs

✍ Domenico Mucci 📂 Article 📅 2001 🏛 European Mathematical Society 🌐 English ⚖ 235 KB

A characterization of some graphs which

A characterization of some graphs which do not contain 3-claws

✍ A.E. Brouwer; M. Numata 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 396 KB

We show that the lattice graphs (grids) and one other family of graphs are characterized by the properties of being reduced, not having 3-claws, and having disconnected p-graphs.

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