Characterization of magic graphs

From MaRDI portal





The following is proved: A graph \(G\) is magic iff every edge of \(G\) belongs to a (1- 2)-factor and every couple of edges is separated by a (1-2)-factor. By (1-2)-factor we mean such factor of \(G\) if each of its components is a regular graph of degree 1 or 2.











This page was built for publication: Characterization of magic graphs

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