scientific article; zbMATH DE number 1228444
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.
- On i-minus-edge-removal-critical graphs
- On Vertex-Edge-Critically n-Connected Graphs
- scientific article; zbMATH DE number 1047741
- On edge-\(b\)-critical graphs
- scientific article; zbMATH DE number 68915
- Domination parameters and edge-removal-critical graphs
- On path-factor critical deleted (or covered) graphs
- On b-vertex and b-edge critical graphs
- Irredundance-edge-removal-critical graphs
- Total domination critical and stable graphs upon edge removal
- On the degrees of vertices in locally finite graphs which possess a certain edge deletion property
- Minimum size of n-factor-critical graphs and k-extendable graphs
- On path-factor critical deleted (or covered) graphs
- Characterizing defect n-extendable graphs and (2n+1)-critical graphs
- The existence of even regular factors of regular graphs on the number of cut edges
- \(k\) -factors in regular graphs
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)