Preview this item
Preview this item
Checking...

# A Theorem on Matchings in the Plane. 2. Some Planar Considerations.

Author: Michael D Plummer; VANDERBILT UNIV NASHVILLE TN. Ft. Belvoir Defense Technical Information Center JAN 1985. Print book : English WorldCat Let G be a graph with (V(G)) = p points and (E(G)) = q lines. A matching in G is any set of lines in E(G) no two of which are adjacent. Matching M in G is said to be a perfect matching, or p.m., if every point of G is covered by a line of M. Let G be any graph with a perfect matching and suppose positive integer n

## Find a copy in the library

Finding libraries that hold this item...

## Details

Document Type: Book Michael D Plummer; VANDERBILT UNIV NASHVILLE TN. Find more information about: Michael D Plummer 227672076 16 pages

### Abstract:

Let G be a graph with (V(G)) = p points and (E(G)) = q lines. A matching in G is any set of lines in E(G) no two of which are adjacent. Matching M in G is said to be a perfect matching, or p.m., if every point of G is covered by a line of M. Let G be any graph with a perfect matching and suppose positive integer n <or minus (p - 2)/2. Then G is n extendable if every matching in G containing n lines is a subset of a p.m. The concept of n-extendability gradually evolved from the study of elementary bipartite graphs (which are 1-extendable) and then of arbitrary 1-extendable (or 'matching-covered') graphs. The study of n-extendability for arbitrary n was begun by the author (1980). This paper is concerned with matchings in planar graphs. When we speak of an imbedding of planar graph G in the plane, we mean a topological imbedding in the usual sense and would remind the reader that such an imbedding is necessarily 2-cell. If we wish to refer to a planar graph G together with an imbedding of G in the plane, we shall speak of the plane graph G. The main result of this paper is to show that no planar graph is 3-extendable.

## Reviews

User-contributed reviews

Be the first.

## Similar Items

### Related Subjects:(5)

Confirm this request

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

### Primary Entity

<http://www.worldcat.org/oclc/227672076> # A Theorem on Matchings in the Plane. 2. Some Planar Considerations.
a schema:CreativeWork, schema:Book ;
library:oclcnum "227672076" ;
library:placeOfPublication <http://id.loc.gov/vocabulary/countries/vau> ;
library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/137372252#Place/ft_belvoir> ; # Ft. Belvoir
schema:about <http://experiment.worldcat.org/entity/work/data/137372252#Topic/numerical_mathematics> ; # Numerical Mathematics
schema:bookFormat bgn:PrintBook ;
schema:contributor <http://experiment.worldcat.org/entity/work/data/137372252#Organization/vanderbilt_univ_nashville_tn> ; # VANDERBILT UNIV NASHVILLE TN.
schema:contributor <http://viaf.org/viaf/7451955> ; # Michael D. Plummer
schema:datePublished "1985" ;
schema:datePublished "JAN 1985" ;
schema:description "Let G be a graph with (V(G)) = p points and (E(G)) = q lines. A matching in G is any set of lines in E(G) no two of which are adjacent. Matching M in G is said to be a perfect matching, or p.m., if every point of G is covered by a line of M. Let G be any graph with a perfect matching and suppose positive integer n "@en ;
schema:exampleOfWork <http://worldcat.org/entity/work/id/137372252> ;
schema:inLanguage "en" ;
schema:name "A Theorem on Matchings in the Plane. 2. Some Planar Considerations."@en ;
schema:productID "227672076" ;
schema:publication <http://www.worldcat.org/title/-/oclc/227672076#PublicationEvent/ft_belvoirdefense_technical_information_centerjan_1985> ;
schema:publisher <http://experiment.worldcat.org/entity/work/data/137372252#Agent/defense_technical_information_center> ; # Defense Technical Information Center
wdrs:describedby <http://www.worldcat.org/title/-/oclc/227672076> ;
.

### Related Entities

<http://experiment.worldcat.org/entity/work/data/137372252#Agent/defense_technical_information_center> # Defense Technical Information Center
a bgn:Agent ;
schema:name "Defense Technical Information Center" ;
.

<http://experiment.worldcat.org/entity/work/data/137372252#Organization/vanderbilt_univ_nashville_tn> # VANDERBILT UNIV NASHVILLE TN.
a schema:Organization ;
schema:name "VANDERBILT UNIV NASHVILLE TN." ;
.

<http://experiment.worldcat.org/entity/work/data/137372252#Topic/numerical_mathematics> # Numerical Mathematics
a schema:Intangible ;
schema:name "Numerical Mathematics"@en ;
.

<http://viaf.org/viaf/7451955> # Michael D. Plummer
a schema:Person ;
schema:familyName "Plummer" ;
schema:givenName "Michael D." ;
schema:name "Michael D. Plummer" ;
.

Content-negotiable representations