Computing Complete Graph Isomorphisms and Hamiltonian Cycles from Partial Ones

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