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

Toughness and Matching Extension in Graphs.

Author: M D Plummer; VANDERBILT UNIV NASHVILLE TN DEPT OF MATHEMATICS.
Publisher: Ft. Belvoir Defense Technical Information Center MAY 1986.
Edition/Format:   Book : English
Database:WorldCat
Summary:
In the present paper, we wish to treat some relationships between toughness of a graph and the n-extendability of the graph. We will prove two results. The first says essentially that if a graph has sufficiently high toughness (and has an even number of points) then it must be n-extendable. The second result applies to graphs with toughness less than one and presents an upper bound on the value of n for which such a  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: 227679967
Description: 17 p.

Abstract:

In the present paper, we wish to treat some relationships between toughness of a graph and the n-extendability of the graph. We will prove two results. The first says essentially that if a graph has sufficiently high toughness (and has an even number of points) then it must be n-extendable. The second result applies to graphs with toughness less than one and presents an upper bound on the value of n for which such a graph can be n-extendable. In the final section, we compare and contrast these results with the n-factor results of Enomoto, Jackson, Katerinis and A. Saito.

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/227679967>
library:oclcnum"227679967"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/227679967>
rdf:typeschema:Book
schema:about
schema:about
schema:about
schema:about
schema:about
schema:contributor
schema:contributor
schema:datePublished"1986"
schema:datePublished"MAY 1986"
schema:description"In the present paper, we wish to treat some relationships between toughness of a graph and the n-extendability of the graph. We will prove two results. The first says essentially that if a graph has sufficiently high toughness (and has an even number of points) then it must be n-extendable. The second result applies to graphs with toughness less than one and presents an upper bound on the value of n for which such a graph can be n-extendable. In the final section, we compare and contrast these results with the n-factor results of Enomoto, Jackson, Katerinis and A. Saito."@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/137379633>
schema:inLanguage"en"
schema:name"Toughness and Matching Extension in Graphs."@en
schema:numberOfPages"17"
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.