Extending matchings in claw-free graphs (Q1322284): Difference between revisions

See the author's paper [Extending matchings in graphs: A survey, Discrete Math. 127, No. 1-3, 277-292 (1994; review above)]\ for definition of \(n\)- extendability and bicriticality. In this paper, the following results are proved: (1) Every 3-connected claw-free graph is bicritical and for \(n\geq 2\), every \((2n+1)\)-connected claw-free graph is \(n\)-extendable. (2) A claw-free \(n\)-extendable graph with minimum degree \(\delta\), satisfies \(\delta\geq 2n\). (3) The only claw-free 3-connected, 2-extendable, planar, even graph is the graph of the icosahedron. (4) No claw-free toroidal graph is 3-extendable.