✦ LIBER ✦

Multicolored forests in bipartite decompositions of graphs

✍ Scribed by Noga Alon; Richard A Brualdi; Bryan L Shader

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 322 KB
Volume: 53
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(91)90059-s

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Decompositions of regular bipartite grap

Decompositions of regular bipartite graphs

✍ Michael S. Jacobson; Miroslaw Truszczyński; Zsolt Tuza 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 692 KB

In this paper we discuss isomorphic decompositions of regular bipartite graphs into trees and forests. We prove that: (1) there is a wide class of r-regular bipartite graphs that are decomposable into any tree of size r, (2) every r-regular bipartite graph decomposes into any double star of size r,

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.

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

Decomposition of bipartite graphs under

Decomposition of bipartite graphs under degree constraints

✍ H. J. Broersma; R. J. Faudree; J. Den Van Heuvel; H. J. Veldman 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 339 KB

## Abstract Let __G__ = __(A, B; E)__ be a bipartite graph. Let __e__~1~, __e__~2~ be nonnegative integers, and __f__~1~, __f__~2~ nonnegative integer‐valued functions on __V(G)__ such that __e__~__i__~ ≦ |__E__| ≦ __e__~1~ + __e__~2~ and __f~i~(v)__ ≦ __d(v)__ ≦ __f__~1~__(v)__ + __f__~2~__(v)__ f

Decomposition of product graphs into com

Decomposition of product graphs into complete bipartite subgraphs

✍ Bruce Reznick; Prasoon Tiwari; Douglas B West 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 291 KB

On the decomposition of kn into complete

On the decomposition of kn into complete bipartite graphs

✍ H. Tverberg 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 76 KB 👁 1 views

## Abstract A short proof is given of the impossibility of decomposing the complete graph on __n__ vertices into __n__‐2 or fewer complete bipartite graphs.