skip to content
On the 2-Extendability of Planar Graphs. Preview this item
ClosePreview this item
Checking...

On the 2-Extendability of Planar Graphs.

Author: D A Holton; Dingjun Lou; Michael D Plummer; VANDERBILT UNIV NASHVILLE TN DEPT OF MATHEMATICS.
Publisher: Ft. Belvoir : Defense Technical Information Center, 1989.
Edition/Format:   Book : English
Database:WorldCat
Summary:
Some sufficient conditions for the 2-extendability of k-connected k-regular (k > or = 3) planar graphs are given. In particular, it is proved that for k > or = 3, a k-connected k-regular planar graph with each cyclic cutset of sufficiently large size is 2-extendable. All graphs in this paper are finite, undirected, connected and simple, although some parallel edge situations will occur after some contractions  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: D A Holton; Dingjun Lou; Michael D Plummer; VANDERBILT UNIV NASHVILLE TN DEPT OF MATHEMATICS.
OCLC Number: 227748120
Description: 27 p. ; 23 x 29 cm.

Abstract:

Some sufficient conditions for the 2-extendability of k-connected k-regular (k > or = 3) planar graphs are given. In particular, it is proved that for k > or = 3, a k-connected k-regular planar graph with each cyclic cutset of sufficiently large size is 2-extendable. All graphs in this paper are finite, undirected, connected and simple, although some parallel edge situations will occur after some contractions are made. However, any loops formed by these contractions will be deleted. Let nu and n be positive integers with n < or = (v - 2)/2 and let G be a graph with nu vertices and epsilon edges having a perfect matching. The graph G is said to be n-extendable if every matching of size n in G lies in a perfect matching of G.

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/227748120>
library:oclcnum"227748120"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/227748120>
rdf:typeschema:Book
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:contributor
schema:contributor
schema:contributor
schema:contributor
schema:datePublished"1989"
schema:description"Some sufficient conditions for the 2-extendability of k-connected k-regular (k > or = 3) planar graphs are given. In particular, it is proved that for k > or = 3, a k-connected k-regular planar graph with each cyclic cutset of sufficiently large size is 2-extendable. All graphs in this paper are finite, undirected, connected and simple, although some parallel edge situations will occur after some contractions are made. However, any loops formed by these contractions will be deleted. Let nu and n be positive integers with n < or = (v - 2)/2 and let G be a graph with nu vertices and epsilon edges having a perfect matching. The graph G is said to be n-extendable if every matching of size n in G lies in a perfect matching of G."
schema:exampleOfWork<http://worldcat.org/entity/work/id/137423607>
schema:inLanguage"en"
schema:name"On the 2-Extendability of Planar Graphs."
schema:numberOfPages"27"
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.