𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On a class of completable partial edge-colourings

✍ Scribed by Alexander Rosa

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
555 KB
Volume
35
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On Colouring Partial Joins of a Complete
On Colouring Partial Joins of a Complete Graph and a Cycle
✍ M. Stiebitz; W. Wessel πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 493 KB

## Abstract Define the partial join of two graphs to be some graph arising from their disjoint union by adding a set of new edges each joining a vertex of the first graph and a vertex of the second one. We characterize all colour‐critical graphs being partial joins of a complete graph and an odd cy

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

On a Class of Matrix Completion Problems
On a Class of Matrix Completion Problems
✍ Vladimir K. Dubovoj; Bernd Fritzsche; Bernd Kirstein πŸ“‚ Article πŸ“… 1989 πŸ› John Wiley and Sons 🌐 English βš– 618 KB
A Note on Alternating Cycles in Edge-Col
A Note on Alternating Cycles in Edge-Coloured Graphs
✍ Anders Yeo πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 431 KB

Grossman and Ha ggkvist gave a sufficient condition under which a two-edgecoloured graph must have an alternating cycle (i.e., a cycle in which no two consecutive edges have the same colour). We extend their result to edge-coloured graphs with any number of colours. That is, we show that if there is