𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Bounding the Size of Equimatchable Graphs of Fixed Genus

✍ Scribed by Ken-ichi Kawarabayashi; Michael D. Plummer

Publisher
Springer Japan
Year
2009
Tongue
English
Weight
140 KB
Volume
25
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Face Size and the Maximum Genus of a Gra
Face Size and the Maximum Genus of a Graph 1. Simple Graphs
✍ Yuanqiu Huang; Yanpei Liu πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 150 KB

This paper shows that a simple graph which can be cellularly embedded on some closed surface in such a way that the size of each face does not exceed 7 is upper embeddable. This settles one of two conjectures posed by Nedela and S8 koviera (1990, in ``Topics in Combinatorics and Graph Theory,'' pp.

Bounds for the average genus of the vert
Bounds for the average genus of the vertex-amalgamation of graphs
✍ Saul Stahl πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 628 KB

The average orientable genus of graphs has been the subject of a considerable number of recent investigations. It is the purpose of this article to examine the extent to which the average genus of the amalgamation of graphs fails to be additive over its constituent subgraphs. This discrepancy is bou