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

DOI10.1016/j.disc.2011.01.028zbMath1223.05244OpenAlexW2044593184MaRDI QIDQ534043

Dingjun Lou, Xuelian Wen, Zan-Bo Zhang

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)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A simple version of Karzanov's blocking flow algorithm
• Characterizing defect \(n\)-extendable bipartite graphs with different connectivities
• Minimum degree of minimal defect \(n\)-extendable bipartite graphs
• On n-extendable graphs
• On defect-d matchings in graphs
• \(M\)-alternating paths in \(n\)-extendable bipartite graphs
• A note on internally disjoint alternating paths in bipartite graphs
• Construction for bicritical graphs and \(k\)-extendable bipartite graphs
• Generalization of matching extensions in graphs