On the enumeration of circular maps with given number of edges

ISSN： 0037-4466

Source： Siberian Mathematical Journal, Vol.54, Iss.4, 2013-07, pp. : 624-639

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

Extremal Zagreb Indices of Graphs with a Given Number of Cut Edges

By Chen Shubo Liu Weijun

Graphs and Combinatorics, Vol. 30, Iss. 1, 2014-01 ,pp. : 109-118

Springer Publishing Company

Access to resources Recommend Favorite

A Logarithmic Connection for Circular Permutation Enumeration

STUDIES IN APPLIED MATHEMATICS, Vol. 22-2526, Iss. 2, 1984-04 ,pp. : 121-139

John Wiley & Sons Inc

Access to resources Recommend Favorite

A Logarithmic Connection for Circular Permutation Enumeration

STUDIES IN APPLIED MATHEMATICS, Vol. 70, Iss. 2, 1984-04 ,pp. : 121-139

John Wiley & Sons Inc

Access to resources Recommend Favorite

Magnetic circular dichroism in Gd metal: the L edges

By Jenkins A. C. M.Temmerman W. Popescu V. Ebert H.

Philosophical Magazine B, Vol. 78, Iss. 5-6, 1998-11 ,pp. : 527-535

Taylor & Francis Ltd

Access to resources Recommend Favorite

An improvement of the Frankl-Wilson theorem on the number of edges in a hypergraph with forbidden intersections of edges

By Ponomarenko E. Raigorodskii A.

Doklady Mathematics, Vol. 89, Iss. 1, 2014-01 ,pp. : 59-60

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite