๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Matching extension and the genus of a graph

โœ Scribed by Michael D Plummer

Publisher
Elsevier Science
Year
1988
Tongue
English
Weight
455 KB
Volume
44
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Matching extension in the powers ofn-con
Matching extension in the powers ofn-connected graphs
โœ Walcher, Kara Lee ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 288 KB ๐Ÿ‘ 1 views

Let G be a graph on p vertices. Then for a positive integer n, G is said to be n-extendible if (i) TI < p / 2 , iii) G has a set of n independent edges, and (iii) every such set is contained in a perfect matching of G. In this paper we will show that if p is even and G is TIconnected, then Gk is ([$

Cochromatic Number and the Genus of a Gr
Cochromatic Number and the Genus of a Graph
โœ H. Joseph Straight ๐Ÿ“‚ Article ๐Ÿ“… 1979 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 310 KB ๐Ÿ‘ 1 views

## Abstract The cochromatic number of a graph __G__, denoted by __z__(__G__), is the minimum number of subsets into which the vertex set of __G__ can be partitioned so that each sbuset induces an empty or a complete subgraph of __G__. In this paper we introduce the problem of determining for a surf

On the maximum genus of a graph
On the maximum genus of a graph
โœ E.A Nordhaus; B.M Stewart; A.T White ๐Ÿ“‚ Article ๐Ÿ“… 1971 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 415 KB
The matching polynomial of a regular gra
The matching polynomial of a regular graph
โœ Robert A. Beezer; E.J. Farrell ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 588 KB

The matching polynomial of a graph has coefficients that give the number ofmatchings in the graph. For a regular graph, we show it is possible to recover the order, degree, girth and number of minimal cycles from the matching polynomial. If a graph is characterized by its matching polynomial, then i