✦ LIBER ✦

Labelled graphs with vertices of degree at least three

✍ Scribed by I. P. Goulden; D. M. Jackson

Publisher: John Wiley and Sons
Year: 1987
Tongue: English
Weight: 463 KB
Volume: 11
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190110208

No coin nor oath required. For personal study only.

✦ Synopsis

The generating function for labelled graphs in which each vertex has degree at least three is obtained by the Principle of Inclusion and Exclusion. Asymptotic and explicit values for the coefficients are calculated in the connected case. The results are extended to bipartite graphs.

📜 SIMILAR VOLUMES

Decomposing graphs with girth at least f

Decomposing graphs with girth at least five under degree constraints

✍ Diwan, Ajit A. 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 137 KB 👁 2 views

We prove that the vertex set of a simple graph with minimum degree at least s + t -1 and girth at least 5 can be decomposed into two parts, which induce subgraphs with minimum degree at least s and t, respectively, where s, t are positive integers ≥ 2.

Graphs with given odd sets and the least

Graphs with given odd sets and the least number of vertices

✍ Louis Hakimi, S. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 64 KB 👁 2 views

This note presents a solution to the following problem posed by Chen, Schelp, and Soltés: find a simple graph with the least number of vertices for which only the degrees of the vertices that appear an odd number of times are given.

Reconstruction of locally finite connect

Reconstruction of locally finite connected graphs with at least three infinite wings

✍ C. St. J. A. Nash-Williams 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 445 KB 👁 1 views

Bipartite labeling of trees with maximum

Bipartite labeling of trees with maximum degree three

✍ Bonnington, C. Paul; ?ir�?, Jozef 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 258 KB 👁 3 views

Let T = (V, E) be a tree with a properly 2-colored vertex set. A bipartite labeling of T is a bijection ϕ: V → {1, . . . , |V |} for which there exists a k such that whenever ϕ(u) ≤ k < ϕ(v), then u and v have different colors. The α-size α(T ) of the tree T is the maximum number of elements in the

Generating quadrangulations of surfaces

Generating quadrangulations of surfaces with minimum degree at least 3

✍ Nakamoto, Atsuhiro 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 171 KB

In this article, we show that all quadrangulations of the sphere with minimum degree at least 3 can be constructed from the pseudo-double wheels, preserving the minimum degree at least 3, by a sequence of two kinds of transformations called "vertex-splitting" and "4-cycle addition." We also consider

On labeling the vertices of products of

On labeling the vertices of products of complete graphs with distance constraints

✍ D.J. Erwin; J.P. Georges; D.W. Mauro 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 71 KB