Graphs with no \(M\)-alternating paths between two vertices: an update

DOI10.1016/J.DISC.2010.08.001zbMath1216.05065OpenAlexW2009132881MaRDI QIDQ712278

Dingjun Lou

Publication date: 28 October 2010

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

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

zbMATH Keywords

perfect matchingnecessary and sufficient condition\(n\)-extendable graph

Mathematics Subject Classification ID

Paths and cycles (05C38)

Cites Work

• Unnamed Item
• Unnamed Item
• On n-extendable graphs
• \(M\)-alternating paths in \(n\)-extendable bipartite graphs
• Graphs with no \(M\)-alternating path between two vertices

This page was built for publication: Graphs with no \(M\)-alternating paths between two vertices: an update