✦ LIBER ✦

The enumeration of cubic maps with given genus and given face degrees

✍ Scribed by Thomas Harmuth

Book ID: 108498086
Publisher: Elsevier Science
Year: 1999
Tongue: English
Weight: 41 KB
Volume: 3
Category: Article
ISSN: 1571-0653
DOI: 10.1016/s1571-0653(05)80026-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the enumeration of circular maps with

On the enumeration of circular maps with given number of edges

✍ Deryagina, M. A.; Mednykh, A. D. 📂 Article 📅 2013 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 265 KB

The construction of cubic and quartic pl

The construction of cubic and quartic planar maps with prescribed face degrees

✍ Gunnar Brinkmann; Thomas Harmuth; Oliver Heidemeier 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 131 KB

In this paper, the existence and availability of computer programs to constructively enumerate all simple connected cubic or quartic planar maps with prescribed number of vertices and face degrees is announced and results of the programs are presented. The underlying algorithms of the computer progr

Automorphisms of Maps with a Given Under

Automorphisms of Maps with a Given Underlying Graph and Their Application to Enumeration

✍ Lin Fan Mao; Yan Pei Liu; Feng Tian 📂 Article 📅 2005 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 206 KB

The enumeration of trees with and withou

The enumeration of trees with and without given limbs

✍ Taojun Lu 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 720 KB

A limb of a tree is the union of one or more branches at a vertex in the tree, where a branch of a tree at a vertex is a maximal subtree containing the given vertex as an end-vertex. In this note, we first consider the enumeration of trees (undirected, oriented or mixed) with forbidden limbs. The en

Enumeration of digraphs with given numbe

Enumeration of digraphs with given number of vertices of odd out-degree and vertices of odd in-degree

✍ Shinsei Tazawa; Teruhiro Shirakura; Saburo Tamura 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 609 KB

## Tazawa, S., T. Shirakura and S. Tamura, Enumeration of digraphs with given number of vertices of odd out-degree and vertices of odd in-degree, Discrete Mathematics 90 (1991) 63-74. In a digraph, a vertex of odd out(in)-degree is called an odd out(in)-vertex. This paper will give the ordinary g

The maximum interval number of graphs wi

The maximum interval number of graphs with given genus

✍ Edward R. Scheinerman 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 202 KB 👁 1 views

The interval number of a graph G, denoted i(G), is the least positive integer t such that G is the intersection graph of sets, each of which is the union of t compact real intervals. It is known that every planar graph has interval number at most 3 and that this result is best possible. We investiga