\(M\)-alternating paths in \(n\)-extendable bipartite graphs

DOI10.1016/S0012-365X(02)00827-0zbMath1021.05058MaRDI QIDQ1402062

Dingjun Lou, Akira Saito, R. E. L. Aldred, Derek Holton

Publication date: 19 August 2003

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

zbMATH Keywords

\(n\)-extendable\(M\)-alternating paths

Mathematics Subject Classification ID

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

Related Items (11)

Characterizing \(2k\)-critical graphs and \(n\)-extendable graphs ⋮ Edge proximity conditions for extendability in regular bipartite graphs ⋮ M-alternating paths and the construction of defect \(n\)-extendable bipartite graphs with different connectivities ⋮ Characterizing minimally \(n\)-extendable bipartite graphs ⋮ A note on internally disjoint alternating paths in bipartite graphs ⋮ Algorithms for (0, 1,d)-graphs withdconstrains ⋮ Graphs with no \(M\)-alternating paths between two vertices: an update ⋮ Characterizing defect \(n\)-extendable graphs and \((2n+1)\)-critical graphs ⋮ M-alternating Hamilton paths and \(M\)-alternating Hamilton cycles ⋮ Graphs with no \(M\)-alternating path between two vertices ⋮ Colouring non-even digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Matching theory
• On n-extendable graphs
• Lower bound of cyclic edge connectivity for \(n\)-extendability of regular graphs
• On the structure of minimally \(n\)-extendable bipartite graphs
• Extending matchings in graphs: A survey

This page was built for publication: \(M\)-alternating paths in \(n\)-extendable bipartite graphs