Sciweavers

147
Voted
CIAC
2010
Springer
234views Algorithms» more  CIAC 2010»
15 years 10 months ago
Enumerating Rooted Graphs with Reflectional Block Structures
In this paper, we consider an arbitrary class H of rooted graphs such that each biconnected component is given by a representation with reflectional symmetry, which allows a roote...
Bingbing Zhuang and Hiroshi Nagamochi