Partitioning a split graph into induced subgraphs isomorphic to the path of order 3.
2019 ◽
Vol 55
(1)
◽
pp. 32-49
Keyword(s):
The study of the computational complexity of problems on graphs is an urgent problem. We show that the problem of deciding whether the vertex set of a given split graph of order 3n can be partitioned into induced subgraphs isomorphic to P3 is a polynomially solvable problem. We develop a polynomial-time algorithm based on the method of augmenting graphs. The developed efficient algorithm can be used for solving team formation problems.
2015 ◽
Vol 14
(09)
◽
pp. 1540011
◽
Keyword(s):
2011 ◽
Vol 03
(03)
◽
pp. 323-336
◽
Keyword(s):
1994 ◽
Vol 03
(03)
◽
pp. 395-405
2005 ◽
Vol 16
(05)
◽
pp. 913-928
◽
2010 ◽
Vol 21
(06)
◽
pp. 905-924
◽
2010 ◽
Vol 20
(01)
◽
pp. 89-104
◽
Keyword(s):
2007 ◽
Vol 17
(02)
◽
pp. 289-328
◽
Keyword(s):
2015 ◽
Vol 14
(05)
◽
pp. 1111-1128
◽