𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On labeling the vertices of products of complete graphs with distance constraints

✍ Scribed by D.J. Erwin; J.P. Georges; D.W. Mauro

Publisher
John Wiley and Sons
Year
2005
Tongue
English
Weight
71 KB
Volume
52
Category
Article
ISSN
0894-069X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the size of graphs with complete-fact
On the size of graphs with complete-factors
✍ Jin Akiyama; Peter Frankl πŸ“‚ Article πŸ“… 1985 πŸ› John Wiley and Sons 🌐 English βš– 188 KB πŸ‘ 1 views
On a random graph with immigrating verti
On a random graph with immigrating vertices: Emergence of the giant component
✍ David J. Aldous; Boris Pittel πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 186 KB πŸ‘ 2 views

A randomly evolving graph, with vertices immigrating at rate n and each possible edge appearing at rate 1/n, is studied. The detailed picture of emergence of giant components with O n 2/3 vertices is shown to be the same as in the ErdΕ‘s-RΓ©nyi graph process with the number of vertices fixed at n at t

The chromaticity of complete bipartite g
The chromaticity of complete bipartite graphs with at most one edge deleted
✍ C. P. Teo; K. M. Koh πŸ“‚ Article πŸ“… 1990 πŸ› John Wiley and Sons 🌐 English βš– 364 KB πŸ‘ 1 views

## Abstract Let __K(p, q), p ≀ q__, denote the complete bipartite graph in which the two partite sets consist of __p__ and __q__ vertices, respectively. In this paper, we prove that (1) the graph __K(p, q)__ is chromatically unique if __p__ β‰₯ 2; and (2) the graph __K(p, q)__ ‐ __e__ obtained by del