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

DOI10.1007/S11464-015-0449-ZzbMATH Open1316.05099OpenAlexW2135974382MaRDI QIDQ2355652FDOQ2355652

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

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

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)

Cites Work

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

Cited In (2)

• 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)