✦ LIBER ✦

3K2-decomposition of a graph

✍ Scribed by A. Bialostocki; Y. Roditty

Publisher: Akadmiai Kiad
Year: 1982
Tongue: English
Weight: 338 KB
Volume: 40
Category: Article
ISSN: 1588-2632
DOI: 10.1007/bf01903577

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

On graph decompositions modulo k

✍ A.D. Scott 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 153 KB

We prove that, for every integer k >~ 2, every graph has an edge-partition into 5k 2 log k sets, each of which is the edge-set of a graph with all degrees congruent to 1 mod k. This answers a question of Pyber. Pyber proved that every graph G has an edge-partition into four sets, each of which is

Decomposition of K13 into a torus graph

Decomposition of K13 into a torus graph and a graph imbedded in the Klein bottle

✍ Oleg O. Borodin; Jean Mayer 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 86 KB

The nonexistence of a (K6-e)-decompositi

The nonexistence of a (K6-e)-decomposition of the complete graph K29

✍ S. G. Hartke; P. R. J. Östergård; D. Bryant; S. I. El-Zanati 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 109 KB

## Abstract We show via an exhaustive computer search that there does not exist a (__K__~6~−__e__)‐decomposition of __K__~29~. This is the first example of a non‐complete graph __G__ for which a __G__‐decomposition of __K__~2|E(G)|+__1__~ does not exist. © 2009 Wiley Periodicals, Inc. J Combin Desi

k-connectivity and decomposition of grap

k-connectivity and decomposition of graphs into forests

✍ Takao Nishizeki; Svatopluk Poljak 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 462 KB

The k-Critical 2k-Connected Graphs for k

The k-Critical 2k-Connected Graphs for k∈{3, 4}

✍ Matthias Kriesell 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 180 KB

A noncomplete graph G is called an (n, k)-graph if it is n-connected and G&X is not (n&|X | +1)-connected for any X V(G) with |X | k. Mader conjectured that for k 3 the graph K 2k+2 -(1-factor) is the unique (2k, k)-graph. We settle this conjecture for k 4.