k-bipartite Matching Extendability of Circulant Graph with Step Length 1 and 4
HUI Zhihao
Abstract：G is said to be bipartite matching-extendable,if every bipartite matching M of is included in a perfect matching of G . The problem determining whether there is a bipartite matching of cardinality k in a graph G is NP-complete. This paper shows that the k-bipartite matching extendability of circulant graphs C2n(1,4) .
Keywords：pefrect matchingbipartite matchingk-bipatrite matching extendablecirculant graph
Publication Date：2017-01-01
Online Publishing Date：2025-08-15(First online date of this platform, not the publication date of the document)
Pages：3( 2097-2098,2196 )