✦ LIBER ✦

Covering a graph by topological complete subgraphs

✍ Scribed by L. K. Jørgensen; L. Pyber

Publisher: Springer Japan
Year: 1990
Tongue: English
Weight: 742 KB
Volume: 6
Category: Article
ISSN: 0911-0119
DOI: 10.1007/bf01787727

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Small topological complete subgraphs of

Small topological complete subgraphs of “dense” graphs

✍ A. Kostochka; L. Pyber 📂 Article 📅 1988 🏛 Springer-Verlag 🌐 English ⚖ 153 KB

Covering the edges of a graph by three o

Covering the edges of a graph by three odd subgraphs

✍ Tamás Mátrai 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 110 KB

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

Covering weighted graphs by even subgrap

Covering weighted graphs by even subgraphs

✍ Genghua Fan 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 225 KB

Cube tiling and covering a complete grap

Cube tiling and covering a complete graph

✍ K. Corrádi; S. Szabó 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 166 KB

On the decomposition of a complete graph

On the decomposition of a complete graph into planar subgraphs

✍ Isao Shirakawa; Hiromitsu Takahashi; Hiroshi Ozaki 📂 Article 📅 1967 🏛 Elsevier Science 🌐 English ⚖ 692 KB