Bipartite double cover and perfect 2-matching covered graph with its algorithm

DOI10.1007/s11464-015-0449-zzbMath1316.05099OpenAlexW2135974382MaRDI QIDQ2355652

Dingjun Lou, Xuelian Wen, Zhiyong Gan, Zan-Bo Zhang

Publication date: 24 July 2015

Published in: Frontiers of Mathematics in China (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11464-015-0449-z

zbMATH Keywords

algorithmbipartite double cover1-extendable graphminimally 1-extendable graphminimally perfect 2-matching covered graphperfect 2-matching covered graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

On defect restricted matching extension graphs ⋮ A fuzzy model for NMT word alignment using quasi-perfect matching

Cites Work

• Multiple Kronecker covering graphs
• Minimal 2-matching-covered graphs
• Matching theory
• On n-extendable graphs
• Regularisable graphs I
• On the structure of minimally \(n\)-extendable bipartite graphs
• Matching extension and minimum degree
• Double covers of graphs
• A general theory of translation
• The Factors of Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Bipartite double cover and perfect 2-matching covered graph with its algorithm