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.
Recommendations
Cites work
Cited in
(9)- Magic graphs, a characterization
- The uniformity space of hypergraphs and its applications
- Some properties of hypohamiltonian graphs
- On magic and supermagic circulant graphs
- Prime-magic labelings of \(K_{n,n}\)
- scientific article; zbMATH DE number 4174984 (Why is no real title available?)
- scientific article; zbMATH DE number 1153391 (Why is no real title available?)
- scientific article; zbMATH DE number 1156651 (Why is no real title available?)
- scientific article; zbMATH DE number 2230300 (Why is no real title available?)
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)