𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On a graph colouring problem

✍ Scribed by Maurice Cochand; Gyula Károlyi


Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
196 KB
Volume
194
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


Role colouring a graph
✍ Martin G. Everett; Steve Borgatti 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 344 KB
Colouring a graph frugally
✍ Hugh Hind; Michael Molloy; Bruce Reed 📂 Article 📅 1997 🏛 Springer-Verlag 🌐 English ⚖ 643 KB
On Colouring Partial Joins of a Complete
✍ 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