Characterizing defect \(n\)-extendable bipartite graphs with different connectivities

DOI10.1016/j.disc.2006.09.036zbMath1117.05093MaRDI QIDQ882112

Xuelian Wen, Dingjun Lou

Publication date: 23 May 2007

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

near perfect matching

Mathematics Subject Classification ID

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

05C75: Structural characterization of families of graphs

Related Items

Algorithms for (0, 1,d)-graphs withdconstrains, M-alternating paths and the construction of defect \(n\)-extendable bipartite graphs with different connectivities, Minimum degree of minimal defect \(n\)-extendable bipartite graphs, Characterizing defect \(n\)-extendable graphs and \((2n+1)\)-critical graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On n-extendable graphs
• On defect-d matchings in graphs
• On matching extensions with prescribed and proscribed edge sets. II
• Two results on matching extensions with prescribed and proscribed edge sets
• Extending matchings in graphs: A survey
• 4-regular claw-free IM-extendable graphs
• On Representatives of Subsets
• On restricted matching extension in planar graphs
• Generalization of matching extensions in graphs
• Maximal IM-unextendable graphs