Component factors of the Cartesian product of graphs
2016 ◽
Vol 09
(02)
◽
pp. 1650041
Keyword(s):
Let [Formula: see text] be a family of connected graphs. A spanning subgraph [Formula: see text] of [Formula: see text] is called an [Formula: see text]-factor (component factor) of [Formula: see text] if each component of [Formula: see text] is in [Formula: see text]. In this paper, we study the component factors of the Cartesian product of graphs. Here, we take [Formula: see text] and show that every connected graph [Formula: see text] has a [Formula: see text]-factor where [Formula: see text] and [Formula: see text] is the maximum degree of an induced subgraph [Formula: see text] in [Formula: see text] or [Formula: see text]. Also, we characterize graphs [Formula: see text] having a [Formula: see text]-factor.
Keyword(s):
1991 ◽
Vol 90
(3)
◽
pp. 297-311
◽
Keyword(s):
2007 ◽
Vol 28
◽
pp. 33-40
◽
2014 ◽
Vol 06
(01)
◽
pp. 1450001
◽
2019 ◽
Vol 12
(2)
◽
pp. 499-505
Keyword(s):
2016 ◽
Vol 36
(3)
◽
pp. 743
◽
2018 ◽
Vol 12
(2)
◽
pp. 297-317
2019 ◽
Vol 19
(04)
◽
pp. 2050068
Keyword(s):