skip to content
Introduction and Terminology 2-Extendability in 3-Polytopes. Preview this item
ClosePreview this item
Checking...

Introduction and Terminology 2-Extendability in 3-Polytopes.

Author: Derek Holton; M D Plummer; VANDERBILT UNIV NASHVILLE TN.
Publisher: Ft. Belvoir Defense Technical Information Center JAN 1985.
Edition/Format:   Book : English
Database:WorldCat
Summary:
Suppose G is a graph with p points and let n be a positive integer such that P> or = 2n + 2. Graph G is said to be n-extendable if every matching of size n in G extends to a perfect matching. A graph G is called bicritical if G - u - v has a perfect matching, for all pairs of points u, v epsilon V (G). In a canonical decomposition theory for graphs in terms of their maximum (or, when present, perfect) matchings  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: Derek Holton; M D Plummer; VANDERBILT UNIV NASHVILLE TN.
OCLC Number: 227702046
Description: 26 p.

Abstract:

Suppose G is a graph with p points and let n be a positive integer such that P> or = 2n + 2. Graph G is said to be n-extendable if every matching of size n in G extends to a perfect matching. A graph G is called bicritical if G - u - v has a perfect matching, for all pairs of points u, v epsilon V (G). In a canonical decomposition theory for graphs in terms of their maximum (or, when present, perfect) matchings is discussed at length. Bicritical graphs play an important roll in this theory. In particular, those bicritical graphs which are 3-connected (the so-called bricks) currently represent the atoms of the decomposition theory in that no further decomposition of these graphs has been obtained as yet. Indeed at present we seem far from an understanding of the structure of bicritical graphs or even that of bricks. Although interesting in its own right, the study of n-extendability became more important when in a previous document it was shown that every 2-extendable non-bipartite graph is a brick and that, for n> or = 2, every n-extendable graph is also (n-1)-extendable. Thus we have available for study a nested set of subcollections of bicritical graphs.

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/227702046>
library:oclcnum"227702046"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/227702046>
rdf:typeschema:Book
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:contributor
schema:contributor
schema:contributor
schema:datePublished"1985"
schema:datePublished"JAN 1985"
schema:description"Suppose G is a graph with p points and let n be a positive integer such that P> or = 2n + 2. Graph G is said to be n-extendable if every matching of size n in G extends to a perfect matching. A graph G is called bicritical if G - u - v has a perfect matching, for all pairs of points u, v epsilon V (G). In a canonical decomposition theory for graphs in terms of their maximum (or, when present, perfect) matchings is discussed at length. Bicritical graphs play an important roll in this theory. In particular, those bicritical graphs which are 3-connected (the so-called bricks) currently represent the atoms of the decomposition theory in that no further decomposition of these graphs has been obtained as yet. Indeed at present we seem far from an understanding of the structure of bicritical graphs or even that of bricks. Although interesting in its own right, the study of n-extendability became more important when in a previous document it was shown that every 2-extendable non-bipartite graph is a brick and that, for n> or = 2, every n-extendable graph is also (n-1)-extendable. Thus we have available for study a nested set of subcollections of bicritical graphs."@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/137399852>
schema:inLanguage"en"
schema:name"Introduction and Terminology 2-Extendability in 3-Polytopes."@en
schema:numberOfPages"26"
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.