✦ LIBER ✦

Disconnected 2-Factors in Planar Cubic Bridgeless Graphs

✍ Scribed by Ajit A. Diwan

Publisher: Elsevier Science
Year: 2002
Tongue: English
Weight: 97 KB
Volume: 84
Category: Article
ISSN: 0095-8956
DOI: 10.1006/jctb.2001.2079

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Path factors in cubic graphs

✍ Ken-ichi Kawarabayashi; Haruhide Matsuda; Yoshiaki Oda; Katsuhiro Ota 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 67 KB

2-factors in triangle-free graphs

✍ Bauer, D.; van den Heuvel, J.; Schmeichel, E. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 440 KB 👁 3 views

We study the cycle structure of I-tough, triangle-free graphs. In particular, w e prove that every such graph on n 2 3 vertices with minimum degree 6 2 i ( n + 2) has a 2-factor. W e also show this is best possible by exhibiting an infinite class of I-tough, triangle-free graphs having 6 = $ ( n + 1

2-factors in random regular graphs

✍ Robalewska, Hanna D. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 474 KB 👁 3 views

In this paper the expectation and variance of the number of 2-factors in random r-regular graphs for any fixed r 2 3 is analyzed and the asymptotic distribution of this variable is determined.

An approximation algorithm for the maxim

An approximation algorithm for the maximum independent set problem in cubic planar graphs

✍ Elarbi Choukhmane; John Franco 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 289 KB 👁 1 views

Toughness and longest cycles in 2-connec

Toughness and longest cycles in 2-connected planar graphs

✍ B�hme, T.; Broersma, H. J.; Veldman, H. J. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 390 KB 👁 2 views

Let G be a planar graph on n vertices, let c(G) denote the length of a longest cycle of G, and let w(G) denote the number of components of G. By a well-known theorem of Tutte, c(G) = n (i.e., G is hamiltonian) if G is 4-connected. Recently, Jackson and Wormald showed that c(G) 2 ona for some positiv

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