skip to content
Matching Extension and the Genus of a Graph. Preview this item
ClosePreview this item
Checking...

Matching Extension and the Genus of a Graph.

Author: Michael D Plummer; VANDERBILT UNIV NASHVILLE TN DEPT OF MATHEMATICS.
Publisher: Ft. Belvoir Defense Technical Information Center MAR 1986.
Edition/Format:   Book : English
Database:WorldCat
Summary:
Let G be a graph with p points having a perfect matching and suppose n is a positive integer with n <or = (p-2)/2. Then G is n-extendable if every matching in G containing n lines is a subset of a perfect matching. In this paper we obtain an upper bound on the n-extendability of a graph in terms of its genus. Keywords: Euler contributions; Theorems. (Author).
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Document Type: Book
All Authors / Contributors: Michael D Plummer; VANDERBILT UNIV NASHVILLE TN DEPT OF MATHEMATICS.
OCLC Number: 227673407
Description: 38 p.

Abstract:

Let G be a graph with p points having a perfect matching and suppose n is a positive integer with n <or = (p-2)/2. Then G is n-extendable if every matching in G containing n lines is a subset of a perfect matching. In this paper we obtain an upper bound on the n-extendability of a graph in terms of its genus. Keywords: Euler contributions; Theorems. (Author).

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


<http://www.worldcat.org/oclc/227673407>
library:oclcnum"227673407"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/227673407>
rdf:typeschema:Book
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:contributor
schema:contributor
schema:datePublished"1986"
schema:datePublished"MAR 1986"
schema:description"Let G be a graph with p points having a perfect matching and suppose n is a positive integer with n "@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/501971211>
schema:inLanguage"en"
schema:name"Matching Extension and the Genus of a Graph."@en
schema:numberOfPages"38"
schema:publisher
schema:url

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.