A note on internally disjoint alternating paths in bipartite graphs

DOI10.1016/j.disc.2004.10.019zbMath1056.05118OpenAlexW2092837495MaRDI QIDQ1764910

Dingjun Lou, Lihua Teng, Akira Saito

Publication date: 22 February 2005

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

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

zbMATH Keywords

MatchingAlternating path

Mathematics Subject Classification ID

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

Related Items (3)

M-alternating paths and the construction of defect \(n\)-extendable bipartite graphs with different connectivities ⋮ Characterizing minimally \(n\)-extendable bipartite graphs ⋮ Algorithms for (0, 1,d)-graphs withdconstrains

Cites Work

• On n-extendable graphs
• \(M\)-alternating paths in \(n\)-extendable bipartite graphs
• Unnamed Item

This page was built for publication: A note on internally disjoint alternating paths in bipartite graphs