𝔖 Bobbio Scriptorium
✦   LIBER   ✦

2-Colorings of complete graphs with a small number of monochromatic K4 subgraphs

✍ Scribed by F. Franek; V. Rödl

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
318 KB
Volume
114
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Graphs with a small number of distinct i
Graphs with a small number of distinct induced subgraphs
✍ Noga Alon; Béla Bollobás 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 514 KB

Let G be a graph on n vertices. We show that if the total number of isomorphism types of induced subgraphs of G is at most &II', where E < lo-\*', then either G or its complement contain an independent set on at least (1 -4e)n vertices. This settles a problem of Erdiis and Hajnal.

Graphs with least number of colorings
Graphs with least number of colorings
✍ A. Sakaloglu; A. Satyanarayana 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 535 KB

## Abstract A λ‐coloring of a graph G is an assignment of λ or fewer colors to the points of G so that no two adjacent points have the same color. Let Ω (n,e) be the collection of all connected n‐point and e‐edge graphs and let Ωp(n,e) be the planar graphs of Ω(n, e). This paper characterizes the g

Hamilton decompositions of complete mult
Hamilton decompositions of complete multipartite graphs with any 2-factor leave
✍ C. D. Leach; C. A. Rodger 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 85 KB 👁 1 views

## Abstract For __m__ ≥ 1 and __p__ ≥ 2, given a set of integers __s__~1~,…,__s__~__q__~ with $s\_j \geq p+1$ for $1 \leq j \leq q$ and ${\sum \_{j\,=\,1}^q} s\_j = mp$, necessary and sufficient conditions are found for the existence of a hamilton decomposition of the complete __p__‐partite graph $