ScholarLens Back to search
2009•Unpublished venueRequires access

2-Bipartite Matching Extendability of C_n×P_2

Zhi‐hao Hui

Open publisher page 0 citations

Abstract

Let G be a connected graph containing a perfect matching.G is said to be bipartite matching extendable if every matching M of G whose induced subgraph is a bipartite matching extends to a perfect matching of G. To further study the bipartite matching extendable graphs,we consider the bipartite matching number of G,denoted by BM (G) ,is the number of edges of a maximum bipartite matching of G. In this paper we prove that Cn×P2 is 2-Bipartite matching extendable.

About this research paper

What this paper is about

Let G be a connected graph containing a perfect matching.G is said to be bipartite matching extendable if every matching M of G whose induced subgraph is a bipartite matching extends to a perfect matching of G. To further study the bipartite matching extendable graphs,we consider the bipartite matching number of G,denoted by BM (G) ,is the number of edges of a maximum bipartite matching of G. In this paper we prove that Cn×P2 is 2-Bipartite matching extendable.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Let G be a connected graph containing a perfect matching.G is said to be bipartite matching extendable if every matching M of G whose induced subgraph is a bipartite matching extends to a perfect matching of G. To further study the bipartite matching extendable graphs,we consider the bipartite matching number of G,denoted by BM (G) ,is the number of edges of a maximum bipartite matching of G. In this paper we prove that Cn×P2 is 2-Bipartite matching extendable.

Key concepts: Bipartite graph, Matching (statistics), 3-dimensional matching, Combinatorics, Factor-critical graph, Mathematics, Complete bipartite graph, Blossom algorithm

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
2-Bipartite Matching Extendability of C_n×P_2 — Research Paper | ScholarLens