𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Achromatic numbers and graph operations

✍ Scribed by Pavol Hell; Donald J. Miller

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
510 KB
Volume
108
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Achromatic number of fragmentable graphs
Achromatic number of fragmentable graphs
✍ Keith Edwards πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 175 KB

## Abstract A __complete coloring__ of a simple graph __G__ is a proper vertex coloring such that each pair of colors appears together on at least one edge. The __achromatic number__ ψ(__G__) is the greatest number of colors in such a coloring. We say a class of graphs is fragmentable if for any po

Some Graph Theoretical Operations and De
Some Graph Theoretical Operations and Decidability
✍ Detlef G. Seese πŸ“‚ Article πŸ“… 1979 πŸ› John Wiley and Sons 🌐 English βš– 378 KB

In [5, 61 a criterion for the undecidability of second order theories of classes of graphs is introduced. This criterion leads to a "measure of complexity" of a class of graphs. In this note we introduce some graph theoretical operations and prove that the class of all graphs which have the smallest

Fan-complete graph Ramsey numbers
Fan-complete graph Ramsey numbers
✍ Li, Yusheng; Rousseau, Cecil C. πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 427 KB πŸ‘ 2 views

It is shown that if G and H are arbitrary fixed graphs and n is sufficiently large, then Also, we prove that r ( K 1 +F, K,) 5 (m+o(l))&(n -+ GO) for any forest Fwhose largest component has m edges. Thus r(Fe, K,) 5 (1 + o(l))&, where Fe = K1 + CK2. We conjecture that r(Fe, K,) -&(n + cm).

Tree-complete graph ramsey numbers
Tree-complete graph ramsey numbers
✍ V. ChvΓ‘tal πŸ“‚ Article πŸ“… 1977 πŸ› John Wiley and Sons 🌐 English βš– 50 KB

## Abstract The ramsey number of any tree of order __m__ and the complete graph of order __n__ is 1 + (__m__ βˆ’ 1)(__n__ βˆ’ 1).