M-alternating paths and the construction of defect n-extendable bipartite graphs with different connectivities

DOI10.1016/J.DISC.2011.01.028MaRDI QIDQ534043zbMATH OpenOpenAlexFDO

Authors Xuelian Wen, Zan-Bo Zhang, Dingjun Lou

Publication date 10 May 2011

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2011.01.028

zbMATH Keywords

A near perfect matchingan \(M\)-alternating pathdefect \(n\)-extendable

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• \(M\)-alternating paths in \(n\)-extendable bipartite graphs
• Characterizing defect n-extendable bipartite graphs with different connectivities
• Construction characterizations for defect \(n\)-extendable bipartite graphs
• Path decomposition of defect 1-extendable bipartite graphs
• scientific article; zbMATH DE number 5532004
• On the number of alternating paths in bipartite complete graphs
• A note on internally disjoint alternating paths in bipartite graphs
• Graphs with no M-alternating paths between two vertices: an update
• scientific article; zbMATH DE number 1104337
• Minimum degree of minimal defect \(n\)-extendable bipartite graphs

Cites work

• scientific article; zbMATH DE number 4066957 (Why is no real title available?)
• A note on internally disjoint alternating paths in bipartite graphs
• A simple version of Karzanov's blocking flow algorithm
• Characterizing defect \(n\)-extendable bipartite graphs with different connectivities
• Construction for bicritical graphs and \(k\)-extendable bipartite graphs
• Generalization of matching extensions in graphs
• Graph theory
• Minimum degree of minimal defect \(n\)-extendable bipartite graphs
• On defect-d matchings in graphs
• On n-extendable graphs
• Path decomposition of defect 1-extendable bipartite graphs
• \(M\)-alternating paths in \(n\)-extendable bipartite graphs

Cited in

(7)

• Graphs with no \(M\)-alternating paths between two vertices: an update
• Characterizing defect \(n\)-extendable bipartite graphs with different connectivities
• Characterizing defect \(n\)-extendable graphs and \((2n+1)\)-critical graphs
• Minimum degree of minimal defect \(n\)-extendable bipartite graphs
• Construction characterizations for defect \(n\)-extendable bipartite graphs
• \(M\)-alternating paths in \(n\)-extendable bipartite graphs
• Path decomposition of defect 1-extendable bipartite graphs

This page was built for publication: M-alternating paths and the construction of defect \(n\)-extendable bipartite graphs with different connectivities

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