skip to content
Matching Extension in Bipartite Graphs. 1. Introduction and Terminology. Preview this item
ClosePreview this item
Checking...

Matching Extension in Bipartite Graphs. 1. Introduction and Terminology.

Author: M D Plummer; VANDERBILT UNIV NASHVILLE TN Dept. of MATHEMATICS.
Publisher: Ft. Belvoir Defense Technical Information Center APR 1986.
Edition/Format:   Print book : EnglishView all editions and formats
Database:WorldCat
Summary:
All graphs in this paper will be finite and connected and will have no loops or parallel lines. Let n and p be positive integers with n <or = (p - 2)/2 and let G be a graph with p points having a perfect matching. Graph G is said to be n-extendable if every matching of size n in G extends to a perfect matching. This paper is concerned primarily with studying n-extendability in bipartite graphs. In the first  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: 227678777
Description: 17 pages

Abstract:

All graphs in this paper will be finite and connected and will have no loops or parallel lines. Let n and p be positive integers with n <or = (p - 2)/2 and let G be a graph with p points having a perfect matching. Graph G is said to be n-extendable if every matching of size n in G extends to a perfect matching. This paper is concerned primarily with studying n-extendability in bipartite graphs. In the first section of this paper the author gathers together the various characterizations of 1-extendable bipartite graphs mentioned above and then give the natural generalizations to n-extendability with a unified proof of the equivalencies. In another paper the author presented some results on the connectivity of general n-extendable graphs. In the second section of this paper proves a result about connectivity which is peculiar to the bipartite case.

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


Primary Entity

<http://www.worldcat.org/oclc/227678777> # Matching Extension in Bipartite Graphs. 1. Introduction and Terminology.
    a schema:Book, schema:CreativeWork ;
   library:oclcnum "227678777" ;
   library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/137379633#Place/ft_belvoir> ; # Ft. Belvoir
   library:placeOfPublication <http://id.loc.gov/vocabulary/countries/vau> ;
   schema:about <http://experiment.worldcat.org/entity/work/data/137379633#Topic/sizes_dimensions> ; # Sizes(dimensions)
   schema:about <http://experiment.worldcat.org/entity/work/data/137379633#Topic/numbers> ; # Numbers
   schema:about <http://experiment.worldcat.org/entity/work/data/137379633#Topic/numerical_mathematics> ; # Numerical Mathematics
   schema:about <http://experiment.worldcat.org/entity/work/data/137379633#Topic/matching> ; # Matching
   schema:about <http://experiment.worldcat.org/entity/work/data/137379633#Topic/graphs> ; # Graphs
   schema:bookFormat bgn:PrintBook ;
   schema:contributor <http://viaf.org/viaf/7451955> ; # M. D. Plummer
   schema:contributor <http://experiment.worldcat.org/entity/work/data/137379633#Organization/vanderbilt_univ_nashville_tn_dept_of_mathematics> ; # VANDERBILT UNIV NASHVILLE TN Dept. of MATHEMATICS.
   schema:datePublished "APR 1986" ;
   schema:datePublished "1986" ;
   schema:description "All graphs in this paper will be finite and connected and will have no loops or parallel lines. Let n and p be positive integers with n "@en ;
   schema:exampleOfWork <http://worldcat.org/entity/work/id/137379633> ;
   schema:inLanguage "en" ;
   schema:name "Matching Extension in Bipartite Graphs. 1. Introduction and Terminology."@en ;
   schema:productID "227678777" ;
   schema:publication <http://www.worldcat.org/title/-/oclc/227678777#PublicationEvent/ft_belvoirdefense_technical_information_centerapr_1986> ;
   schema:publisher <http://experiment.worldcat.org/entity/work/data/137379633#Agent/defense_technical_information_center> ; # Defense Technical Information Center
   wdrs:describedby <http://www.worldcat.org/title/-/oclc/227678777> ;
    .


Related Entities

<http://experiment.worldcat.org/entity/work/data/137379633#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/137379633#Organization/vanderbilt_univ_nashville_tn_dept_of_mathematics> # VANDERBILT UNIV NASHVILLE TN Dept. of MATHEMATICS.
    a schema:Organization ;
   schema:name "VANDERBILT UNIV NASHVILLE TN Dept. of MATHEMATICS." ;
    .

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

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


Content-negotiable representations

Close Window

Please sign in to WorldCat 

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