scientific article; zbMATH DE number 1228444

From MaRDI portal
Publication:4221699





A graph \(G\) is said to be \(n\)-edge-deletable (resp., \(n\)-critical) if \(G-S\) has a perfect matching for any set \(S\) of \(n\) of its edges (resp., vertices). \(G\) is said to be \(k\)-extendable if every matching of size \(k\) can be extended to a perfect matching. (\textit{M. D. Plummer} has written a survey on this subject [see Congr. Numerantium 116, 3-32 (1996; Zbl 0902.05059)].) The authors present several (mostly simple) results concerning these and related notions. Reviewer's note: Lemma 1, asserting that for every \(k\) the \(k\)th power of a connected graph is \(2^{k-1}\)-connected, is false.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4221699)