THE MINIMUM NUMBER OF FOX COLORS AND QUANDLE COCYCLE INVARIANTS

Computing graph invariants on rotagraphs

Computing graph invariants on rotagraphs using dynamic algorithm approach: the case of (2,1)-colorings and independence numbers

✍ Sandi Klavžar; Aleksander Vesel 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 571 KB

Rotagraphs generalize all standard products of graphs in which one factor is a cycle. A computer-based approach for searching graph invariants on rotagraphs is proposed and two of its applications are presented. First, the -numbers of the Cartesian product of a cycle and a path are computed, where t