✦ LIBER ✦

k-connectivity and decomposition of graphs into forests

✍ Scribed by Takao Nishizeki; Svatopluk Poljak

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 462 KB
Volume: 55
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(94)90015-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Isomorphic decomposition of complete gra

Isomorphic decomposition of complete graphs into linear forests

✍ Sergio Ruiz 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 115 KB 👁 1 views

The decompositions of line graphs, middl

The decompositions of line graphs, middle graphs and total graphs of complete graphs into forests

✍ Jin Akiyama; Takashi Hamada 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 461 KB

We construct decompositions of L(K,,), M(K,,) and T(K,,) into the minimum number of line-disjoint spanning forests by applying the usual criterion for a graph to be eulerian. This gives a realization of the arboricity of each of these three graphs. ## 1. Preliminaries In this paper a graph is cons

Decompositions of graphs into forests wi

Decompositions of graphs into forests with bounded maximum degree

✍ Mirosław Truszczyński 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 995 KB

Truszczydski, M., Decompositions of graphs into forests with bounded maximum degree, Discrete Mathematics 98 (1991) 207-222.

Decompositions of highly connected graph

Decompositions of highly connected graphs into paths of length 3

✍ Carsten Thomassen 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 101 KB 👁 1 views

## Abstract We prove that a 171‐edge‐connected graph has an edge‐decomposition into paths of length 3 if and only its size is divisible by 3. It is a long‐standing problem whether 2‐edge‐connectedness is sufficient for planar triangle‐free graphs, and whether 3‐edge‐connectedness suffices for graph

Decompositions of regular graphs into Kn

Decompositions of regular graphs into Knc ∨ 2K2

✍ R. Balakrishnan; R. Sampathkumar 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 437 KB

The join K~ V2K2 is the graph obtained by taking a copy ofK, ~ and two disjoint copies of K2, disjoint from K c, and joining every vertex of K, c to every vertex of 2K2. In this paper we show that for each positive integer n, the graph K, ~ V 2/(2 admits a p-valuation and has gracefulness 4n + 3. Fu

Connectivity of k-extendable graphs with

Connectivity of k-extendable graphs with large k

✍ Dingjun Lou; Qinglin Yu 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 198 KB

Let G be a simple connected graph on 2n vertices with perfect matching. For a given positive integer k (0 , then either G is bipartite or the connectivity of G is at least 2k. As a corollary, we show that if G is a maximal k-extendable graph on 2n vertices with n + 2 6 2k + 1, then G is Kn;n if k +