Every 3-connected $$\{K_{1,3},N_{1,2,3}\}$$ { K 1 , 3 , N 1 , 2 , 3 } -free graph is Hamilton-connected
2015 ◽
Vol 32
(2)
◽
pp. 685-705
◽
1996 ◽
Vol 23
(2)
◽
pp. 191-201
◽
2003 ◽
Vol 268
(1-3)
◽
pp. 185-197
◽
Keyword(s):
Keyword(s):
2008 ◽
Vol 62
(1)
◽
pp. 77-92
◽
2013 ◽
Vol 56
(8)
◽
pp. 1585-1595
◽
Keyword(s):
Keyword(s):