Complexity of chemical graphs in terms of size, branching, and cyclicity

ISSN： 1062-936X

Source： SAR and QSAR in Environmental Research, Vol.17, Iss.4, 2006-08, pp. : 429-466

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

The complexity of short schedulesfor uet bipartite graphs

By Bampis Evripidis

RAIRO - Operations Research, Vol. 33, Iss. 3, 2010-03 ,pp. : 367-370

Edp Sciences

Access to resources Recommend Favorite

Complexity Theoretical Results on Nondeterministic Graph-driven Read-Once Branching Programs

By Bollig Beate

RAIRO - Theoretical Informatics and Applications, Vol. 37, Iss. 1, 2010-03 ,pp. : 51-66

Edp Sciences

Access to resources Recommend Favorite

A note on the Size-Ramsey number of long subdivisions of graphs

By Donadelli Jair Haxell Penny E. Kohayakawa Yoshiharu

RAIRO - Theoretical Informatics and Applications, Vol. 39, Iss. 1, 2010-03 ,pp. : 191-206

Edp Sciences

Access to resources Recommend Favorite

A note on maximum independent sets and minimum clique partitions in unit disk graphs and penny graphs: complexity and approximation

By Cerioli Marcia R. Faria Luerbio Ferreira Talita O. Protti Fábio

RAIRO - Theoretical Informatics and Applications, Vol. 45, Iss. 3, 2011-09 ,pp. : 331-346

Edp Sciences

Access to resources Recommend Favorite

Independent effects of patch size and structural complexity on diversity of benthic macroinvertebrates

Ecology, Vol. 91, Iss. 7, 2010-07 ,pp. : 1908-1915

John Wiley & Sons Inc

Access to resources Recommend Favorite