Abstract
We consider a graph G with 2κ vertices of degree 5 and κ vertices of degree 2, all other vertices being of degree 4. In connection with the timetable optimization problem, we study necessary and sufficient conditions for the existence of a factorization of G into two skeleton subgraphs whose edge sets are disjoint and have the same cardinality and, for each vertex of the graph, the numbers of edges incident to this vertex in these subgraphs differ at most by unity.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
V. N. Sachkov, Introduction to Combinatorial Methods of Discrete Mathematics (Nauka, Moscow, 1982) [in Russian].
A. M. Magomedov, “Condensing timetables with a target time divisible by the number of class hours of each instructor,” Mat. Zametki 85(1), 65–72 (2009) [Math. Notes 85 (1), 61–67 (2009)].
J. Petersen, “Die Theorie der regulären Graphs,” Acta Math. 15(1), 193–220 (1891).
A. M. Magomedov, “Arrangement of indivisible 2-words in a matrix as a graph factorization problem,” Vestnik Dagestansk. Nauchn. Tsentra, No. 23, 5–14 (2006).
A. M. Magomedov, “On the edge coloring of a bipartite graph,” Diskret. Mat. 21(2), 153–158 (2009) [Discrete Math. Appl. 19 (1), 81–87 (2009)].
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © A. M. Magomedov, 2011, published in Matematicheskie Zametki, 2011, Vol. 89, No. 3, pp. 378–383.
Rights and permissions
About this article
Cite this article
Magomedov, A.M. Existence of a trade-off factorization of a partially 4-homogeneous graph. Math Notes 89, 361–365 (2011). https://doi.org/10.1134/S0001434611030072
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0001434611030072