𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the decomposition of a complete graph into planar subgraphs

✍ Scribed by Isao Shirakawa; Hiromitsu Takahashi; Hiroshi Ozaki

Publisher
Elsevier Science
Year
1967
Tongue
English
Weight
692 KB
Volume
283
Category
Article
ISSN
0016-0032

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Sharp bounds for decompositions of graph
Sharp bounds for decompositions of graphs into completer-partite subgraphs
✍ Gregory, David A.; Vander Meulen, Kevin N. πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 435 KB πŸ‘ 2 views

If G is a graph on n vertices and r 2 2, w e let m,(G) denote the minimum number of complete multipartite subgraphs, with r or fewer parts, needed to partition the edge set, f(G). In determining m,(G), w e may assume that no two vertices of G have the same neighbor set. For such reduced graphs G, w

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.

On the decomposition of Kn into complete
On the decomposition of Kn into complete m-partite graphs
✍ Qingxue Huang πŸ“‚ Article πŸ“… 1991 πŸ› John Wiley and Sons 🌐 English βš– 195 KB πŸ‘ 1 views

## Abstract Graham and Pollak [3] proved that __n__ βˆ’1 is the minimum number of edge‐disjoint complete bipartite subgraphs into which the edges of __K__~__n__~ can be decomposed. Using a linear algebraic technique, Tverberg [2] gives a different proof of that result. We apply his technique to show

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