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

DOI10.1016/J.DISC.2011.01.028zbMATH Open1223.05244OpenAlexW2044593184MaRDI QIDQ534043FDOQ534043

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

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

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

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

Cited In (7)

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