Author： Nishimura N. Ragde P. Thilikos D.M.
Publisher： Elsevier
ISSN： 0196-6774
Source： Journal of Algorithms, Vol.42, Iss.1, 2002-01, pp. : 69-108
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
Clique complexes and graph powers
Israel Journal of Mathematics, Vol. 196, Iss. 1, 2013-08 ,pp. :
Access to resources
Recommend
Induced Matching Extendable Graph Powers
By Qian Jianguo
Graphs and Combinatorics, Vol. 22, Iss. 3, 2006-11 ,pp. :
Eigenvalue and nodal properties on quantum graph trees*
Waves in Random and Complex Media, Vol. 16, Iss. 3, 2006-08 ,pp. :
Approximating Maximum Leaf Spanning Trees in Almost Linear Time
Journal of Algorithms, Vol. 29, Iss. 1, 1998-10 ,pp. :