Uniquely monopolar-partitionable block graphs
2014 ◽
Vol Vol. 16 no. 2
(PRIMA 2013)
◽
Keyword(s):
Special issue PRIMA 2013 International audience As a common generalization of bipartite and split graphs, monopolar graphs are defined in terms of the existence of certain vertex partitions. It has been shown that to determine whether a graph has such a partition is NP-complete for general graphs and polynomial for several classes of graphs. In this paper, we investigate graphs that admit a unique such partition and call them uniquely monopolar-partitionable graphs. By employing a tree trimming technique, we obtain a characterization of uniquely monopolar-partitionable block graphs. Our characterization implies a polynomial time algorithm for recognizing them.
2005 ◽
Vol 2005
(9)
◽
pp. 1405-1413
◽
2013 ◽
Vol 05
(04)
◽
pp. 1350024
◽
Keyword(s):
Keyword(s):
2011 ◽
Vol Vol. 13 no. 4
◽
2007 ◽
Vol Vol. 9 no. 1
(Graph and Algorithms)
◽
2007 ◽
Vol Vol. 9 no. 1
(Analysis of Algorithms)
◽
Keyword(s):