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

DOI10.1007/S11464-015-0449-ZMaRDI QIDQ2355652zbMATH OpenOpenAlexFDO

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

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

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

Recommendations

• On 2-matching covered graphs and 2-matching deleted graphs
• Minimal 2-matching-covered graphs
• On perfect matchings in matching covered graphs
• Construction for bicritical graphs and \(k\)-extendable bipartite graphs
• Recognizing near-bipartite Pfaffian graphs in polynomial time

Cites work

• scientific article; zbMATH DE number 4066957 (Why is no real title available?)
• scientific article; zbMATH DE number 3732108 (Why is no real title available?)
• scientific article; zbMATH DE number 637274 (Why is no real title available?)
• A general theory of translation
• Double covers of graphs
• Matching extension and minimum degree
• Matching theory
• Minimal 2-matching-covered graphs
• Multiple Kronecker covering graphs
• On n-extendable graphs
• On the structure of minimally \(n\)-extendable bipartite graphs
• Regularisable graphs I
• The Factors of Graphs

Cited in

(4)

• On 2-matching covered graphs and 2-matching deleted graphs
• Minimal 2-matching-covered graphs
• A fuzzy model for NMT word alignment using quasi-perfect matching
• On defect restricted matching extension graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2355652)