On the structure of minimally \(n\)-extendable bipartite graphs

DOI10.1016/S0012-365X(98)00291-XzbMath0931.05069MaRDI QIDQ1301712

Dingjun Lou

Publication date: 23 February 2000

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

zbMATH Keywords

perfect matchingminimally \(n\)-extendable bipartite graph

Mathematics Subject Classification ID

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

Related Items (9)

Edge proximity conditions for extendability in regular bipartite graphs ⋮ Minimally \(k\)-factor-critical graphs for some large \(k\) ⋮ \(M\)-alternating paths in \(n\)-extendable bipartite graphs ⋮ Connectivity of \(k\)-extendable graphs with large \(k\). ⋮ Characterizing minimally \(n\)-extendable bipartite graphs ⋮ Hamiltonian and long cycles in bipartite graphs with connectivity ⋮ Bipartite matching extendable graphs ⋮ Minimum degree of minimal defect \(n\)-extendable bipartite graphs ⋮ Bipartite double cover and perfect 2-matching covered graph with its algorithm

Cites Work

• Matching theory
• On n-extendable graphs
• Lower bound of cyclic edge connectivity for \(n\)-extendability of regular graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the structure of minimally \(n\)-extendable bipartite graphs