A spanning union of cycles in thin cylinder, torus and Klein bottle grid graphs

MaRDI QIDQ6414604zbMATH OpenFDO

Authors Jelena Đokić, Ksenija Doroslovački, Olga Bodroža-Pantić

Publication date 20 October 2022

Abstract: We propose an algorithm for obtaining the common transfer digraph $D_m^{\ast }$ for enumeration of 2-factors in graphs from the title all of which with $mn$ vertices ($m,ninN,m>1$). The numerical data gathered for $m<19$ reveal some matchings of the numbers of 2-factors for different types of torus or Klein bottle. In latter case we conjecture that these numbers are invariant under twisting.

This page was built for publication: A spanning union of cycles in thin cylinder, torus and Klein bottle grid graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6414604)