๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Minimal Edge-Colourings of Complete Graphs

โœ Scribed by Cameron, P. J.

Book ID
120096104
Publisher
Oxford University Press
Year
1975
Tongue
English
Weight
237 KB
Volume
s2-11
Category
Article
ISSN
0024-6107

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Properly coloured Hamiltonian paths in e
Properly coloured Hamiltonian paths in edge-coloured complete graphs
โœ J. Bang-Jensen; G. Gutin; A. Yeo ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 251 KB

We consider edge-coloured complete graphs. A path or cycle Q is called properly coloured (PC) if any two adjacent edges of Q differ in colour. Our note is inspired by the follou~ng conjecture by B. Bollobis and P. Erdijs (1976): if G is an edge-coloured complete graph on )I vertices in which the max

Edge-coloured complete graphs: Connected
Edge-coloured complete graphs: Connectedness of some subgraphs
โœ Adam Idzik; Jan Komar; Marcin Malawski ๐Ÿ“‚ Article ๐Ÿ“… 1987 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 435 KB

If the edges of a complete graph K,., m/> 4, are painted two colours so that monochromatic K " graphs are connected, then there exists an increasing sequence ( n)n~4 of complete subgraphs whose monochromatic subgraphs are also connected. For more than two colours this is not true, but an analogous f

About acyclic edge colourings of planar
About acyclic edge colourings of planar graphs
โœ Anna Fiedorowicz; Mariusz Haล‚uszczak; Narayanan Narayanan ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 180 KB