Complexity of conditional colouring with given template
2014 ◽
Vol Vol. 16 no. 3
(Graph Theory)
◽
Keyword(s):
Graph Theory International audience We study partitions of the vertex set of a given graph into cells that each induce a subgraph in a given family, and for which edges can have ends in different cells only when those cells correspond to adjacent vertices of a fixed template graph H. For triangle-free templates, a general collection of graph families for which the partitioning problem can be solved in polynomial time is described. For templates with a triangle, the problem is in some cases shown to be NP-complete.
2015 ◽
Vol Vol. 17 no. 1
(Graph Theory)
◽
Keyword(s):
2011 ◽
Vol Vol. 13 no. 4
◽
2015 ◽
Vol Vol. 17 no. 1
(Graph Theory)
◽
Keyword(s):
2010 ◽
Vol Vol. 12 no. 5
(Graph and Algorithms)
◽
Keyword(s):
2010 ◽
Vol Vol. 12 no. 1
(Graph and Algorithms)
◽
Keyword(s):
2005 ◽
Vol DMTCS Proceedings vol. AE,...
(Proceedings)
◽
Keyword(s):
2005 ◽
Vol DMTCS Proceedings vol. AF,...
(Proceedings)
◽
2008 ◽
Vol Vol. 10 no. 1
(Graph and Algorithms)
◽
Keyword(s):