New concept of connection in bidirected graphs
Keyword(s):
In bidirected graph an edge has a direction at each end. We introduce a new definition of connection in a bidirected graph. We prove some properties of this definition and we establish a relationship to connection and imbalance in the corresponding signed graph. The main result gives a sufficient condition for a signed graph to have a Biconnected biorientation.
1987 ◽
Vol 10
(4)
◽
pp. 671-692
◽
2012 ◽
Vol 22
(06)
◽
pp. 1250130
2007 ◽
Vol 38
(3)
◽
pp. 267-276
◽
2002 ◽
Vol 10
(03)
◽
pp. 213-225
◽
Keyword(s):
1995 ◽
Vol 15
(44-45)
◽
pp. 7-21
◽
Keyword(s):
2010 ◽
Vol 439-440
◽
pp. 920-925
Keyword(s):
2011 ◽
Vol 393-395
◽
pp. 20-23