𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Thickness of graphs with degree constrained vertices

✍ Scribed by Bose, N.; Prabhu, K.

Book ID
117913884
Publisher
IEEE
Year
1977
Weight
678 KB
Volume
24
Category
Article
ISSN
0098-4094

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Labelled graphs with vertices of degree
Labelled graphs with vertices of degree at least three
✍ I. P. Goulden; D. M. Jackson πŸ“‚ Article πŸ“… 1987 πŸ› John Wiley and Sons 🌐 English βš– 463 KB πŸ‘ 1 views

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.

Vertices of Small Degree in Uniquely Ham
Vertices of Small Degree in Uniquely Hamiltonian Graphs
✍ J.A. Bondy; Bill Jackson πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 206 KB

Let G be a uniquely hamiltonian graph on n vertices. We show that G has a vertex of degree at most c log 2 8n+3, where c=(2&log 2 3) &1 r2.41. We show further that G has at least two vertices of degree less than four if it is planar and at least four vertices of degree two if it is bipartite.

Triangles with restricted degree sum of
Triangles with restricted degree sum of their boundary vertices in plane graphs
✍ Oleg V. Borodin πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 373 KB

It is known that under appropriate assumptions, each plane graph contains a vertex of degree at most 5 and a pair of adjacent vertices with degree sum at most 13. Two structural assumptions are established for a plane graph which together guarantee the existence of a triple of pairwise adjacent vert