Graphs with no \(M\)-alternating path between two vertices
type: Item
instance of: scholarly article
title: Graphs with no \(M\)-alternating path between two vertices
zbMATH Open document ID: 1041.05062
author: Dingjun Lou
author: Dongning Rao
published in: Discrete Mathematics
publication date: 2004-08-06T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C75
zbMATH DE Number: 2083649
zbMATH Keywords: \(M\)-alternating path
zbMATH Keywords: Perfect matching
zbMATH Keywords: \(n\)-Extendable graphs
MaRDI profile type: Publication
full work available at URL: j.disc.2003.08.002
OpenAlex ID: W1971034268
cites work: \(M\)-alternating paths in \(n\)-extendable bipartite graphs
cites work: Characterizing \(2k\)-critical graphs and \(n\)-extendable graphs
cites work: Q5422499
cites work: Paths, Trees, and Flowers
cites work: Q4820527
cites work: Q4551374
cites work: On n-extendable graphs
cites work: Q4393233
DOI: 10.1016/J.DISC.2003.08.002
description: scientific article; zbMATH DE number 2083649