Constructive enumeration of graphs

E-ISSN： 1755-1633|38|1|159-159

ISSN： 0004-9727

Source： Bulletin of the Australian Mathematical Society, Vol.38, Iss.1, 1988-08, pp. : 159-159

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

Related content

Characterization and enumeration of hypotraversable graphs

Bulletin of the Australian Mathematical Society, Vol. 20, Iss. 3, 1979-06 ,pp. : 437-445

Cambridge University Press

Access to resources Recommend Favorite

Some problems in the enumeration of labelled graphs

Bulletin of the Australian Mathematical Society, Vol. 21, Iss. 1, 1980-02 ,pp. : 159-160

Cambridge University Press

Access to resources Recommend Favorite

Enumeration of non-positive planar trivalent graphs

By Westbury Bruce

Journal of Algebraic Combinatorics, Vol. 25, Iss. 4, 2007-06 ,pp. : 357-373

Springer Publishing Company

Access to resources Recommend Favorite

Fast Enumeration Algorithms for Non-crossing Geometric Graphs

By Katoh Naoki Tanigawa Shin-Ichi

Discrete & Computational Geometry, Vol. 42, Iss. 3, 2009-10 ,pp. : 443-468

Springer Publishing Company

Access to resources Recommend Favorite

Enumeration of Hypergraphs

By Ishihara T.

European Journal of Combinatorics, Vol. 22, Iss. 4, 2001-05 ,pp. : 503-509

Elsevier

Access to resources Recommend Favorite