skip to content
Matching Extension in Regular Graphs. Preview this item
ClosePreview this item
Checking...

Matching Extension in Regular Graphs.

Author: M D Plummer; VANDERBILT UNIV NASHVILLE TN DEPT OF MATHEMATICS.
Publisher: Ft. Belvoir : Defense Technical Information Center, 1989.
Edition/Format:   Book : English
Database:WorldCat
Summary:
This paper deals with extending matching in regular graphs. There are two main results. The first presents a sufficient condition in terms of cyclic connectivity for extending matching in regular bipartite graphs. This theorem generalizes an earlier result due to Holton and the author. The second result deals with regular-but not necessarily bipartite-graphs. In this case, it is known that a result analogous to that  Read more...
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: M D Plummer; VANDERBILT UNIV NASHVILLE TN DEPT OF MATHEMATICS.
OCLC Number: 227751519
Description: 17 p. ; 23 x 29 cm.

Abstract:

This paper deals with extending matching in regular graphs. There are two main results. The first presents a sufficient condition in terms of cyclic connectivity for extending matching in regular bipartite graphs. This theorem generalizes an earlier result due to Holton and the author. The second result deals with regular-but not necessarily bipartite-graphs. In this case, it is known that a result analogous to that obtained in the bipartite case is impossible, but a new proof is given of a result of Naddef and Pulleyblank which guarantees that a regular graph with an even number of points which has sufficiently large cyclic connectivity will be bicritical. Algorithms. (jes).

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/227751519>
library:oclcnum"227751519"
library:placeOfPublication
library:placeOfPublication
rdf:typeschema:Book
schema:about
schema:about
schema:about
schema:about
schema:about
schema:contributor
schema:contributor
schema:datePublished"1989"
schema:description"This paper deals with extending matching in regular graphs. There are two main results. The first presents a sufficient condition in terms of cyclic connectivity for extending matching in regular bipartite graphs. This theorem generalizes an earlier result due to Holton and the author. The second result deals with regular-but not necessarily bipartite-graphs. In this case, it is known that a result analogous to that obtained in the bipartite case is impossible, but a new proof is given of a result of Naddef and Pulleyblank which guarantees that a regular graph with an even number of points which has sufficiently large cyclic connectivity will be bicritical. Algorithms. (jes)."
schema:exampleOfWork<http://worldcat.org/entity/work/id/137426801>
schema:inLanguage"en"
schema:name"Matching Extension in Regular Graphs."
schema:numberOfPages"17"
schema:publication
schema:publisher
wdrs:describedby

Content-negotiable representations

Close Window

Please sign in to WorldCat 

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