Graphs with no \(M\)-alternating path between two vertices

DOI10.1016/j.disc.2003.08.002zbMath1041.05062OpenAlexW1971034268MaRDI QIDQ1827684

Dongning Rao, Dingjun Lou

Publication date: 6 August 2004

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

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

zbMATH Keywords

Perfect matching\(M\)-alternating path\(n\)-Extendable graphs

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Related Items (1)

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

Cites Work

• On n-extendable graphs
• \(M\)-alternating paths in \(n\)-extendable bipartite graphs
• Characterizing \(2k\)-critical graphs and \(n\)-extendable graphs
• Paths, Trees, and Flowers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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