Minmax subtree cover problem on cacti
- 作者Hiroshi Nagamochi; Taizo Kawada
- 卷第154卷
- 期第8期
- 印刷ISSN0166-218X
- 文件大小234.13KB
- 发表时间2006
- DOI10.1016/j.dam.2005.10.013
- 页码1254-1263
同作者推荐
Graph homomorphisms through random walksAmir Daneshgar; Hossein Hajiabolhassan · 2003
Graph homomorphisms and nodal domainsAmir Daneshgar; Hossein Hajiabolhassan · Linear Algebra and its Applications · 2006
On defining numbers of circular complete graphsAmir Daneshgar; Hossein Hajiabolhassan; Nasrin Soltankhah · 2007
Density and power graphs in graph homomorphism problemAmir Daneshgar; Hossein Hajiabolhassan · 2008
Circular colouring and algebraic no-homomorphism theoremsAmir Daneshgar; Hossein Hajiabolhassan · 2007
On the isoperimetric spectrum of graphs and its approximationsAmir Daneshgar; Hossein Hajiabolhassan; Ramin Javadi · 2010