✦ LIBER ✦

On biclique partitions of the complete graph

✍ Scribed by Bryan L. Shader

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 930 KB
Volume: 117
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(93)90335-q

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Covering the complete graph by partition

Covering the complete graph by partitions

✍ Zoltán Füredi 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 530 KB

A (D, c)-coloring of the complete graph K" is a coloring of the edges with c colors such that all monochromatic connected subgraphs have at most D vertices. Resolvable block designs with c parallel classes and with block size D are natural examples of (D, c)-colorings. However, (D, c)-colorings are

Rank and biclique partitions of the comp

Rank and biclique partitions of the complement of paths

✍ Boyer, Elizabeth D. 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 230 KB 👁 1 views

The problem was posed of determining the biclique partition number of the complement of a Hamiltonian path (Monson, Rees, and Pullman, Bull. Inst. Combinatorics and Appl. 14 (1995), 17-86). We define the complement of a path P , denoted P , as the complement of P in K m,n where P is a subgraph of K

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

On balanced claw designs of complete mul

On balanced claw designs of complete multi-partite graphs

✍ Kazuhiko Ushio 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 201 KB

In this paDer,

Two characterizations of interchange gra

Two characterizations of interchange graphs of complete m-partite graphs

✍ Curtis R. Cook 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 564 KB

A graph G is m-partite if its points can be partitioned into m subsets Yl, . . . . Vm such that every line joins a point in Vi with a point in Vi, i + j. A complete m-partite graph contains every line joining Vi with V-. A complete graph Kp has every pair of its p points adjacent. The nth interchang

Quadrangular embeddings of the complete

Quadrangular embeddings of the complete even k-partite graph

✍ Nora Hartsfield; Gerhard Ringel 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 240 KB

The complete even k-partite graph K n,.n\* ,..., "\* is the complete k-partite graph where all the n,'s are even numbers. Orientable and nonorientable quadrangular embeddings are constructed for all these graphs.