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.
- 1-Factors and Antifactor Sets
- Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé
- Claw‐free graphs are edge reconstructible
- Connected, locally 2-connected,K1,3-free graphs are panconnected
- Every connected, locally connected nontrivial graph with no induced claw is hamiltonian
- Extending matchings in planar graphs. IV
- Graphs with 1-Factors
- scientific article; zbMATH DE number 4135992 (Why is no real title available?)
- scientific article; zbMATH DE number 3465360 (Why is no real title available?)
- scientific article; zbMATH DE number 3492724 (Why is no real title available?)
- scientific article; zbMATH DE number 3571502 (Why is no real title available?)
- scientific article; zbMATH DE number 4118405 (Why is no real title available?)
- scientific article; zbMATH DE number 4193713 (Why is no real title available?)
- Matching extension and the genus of a graph
- Matching theory
- On maximal independent sets of vertices in claw-free graphs
- On n-extendable graphs
- The complexity of computing the permanent
- The Complexity of Enumeration and Reliability Problems
- The strong perfect-graph conjecture is true for \(K_{1,3}\)-free graphs
- On matching extensions with prescribed and proscribed edge sets. II
- Claw-free graphs---a survey
- Matching extension in \(K_{1,r}\)-free graphs with independent claw centers
- Matching properties in domination critical graphs.
- Matchings and matching extensions in graphs
- On cycle-nice claw-free graphs
- Total coloring of claw-free planar graphs
- Extending perfect matchings to Hamiltonian cycles in line graphs
- Forbidden pairs for the matching extendability of graphs with connectivity at least 2 or 3
- Clique-transversal sets and clique-coloring in planar graphs
- 3-factor-criticality in domination critical graphs
- Minimal claw-free graphs
- Factor-criticality and matching extension in DCT-graphs
- scientific article; zbMATH DE number 861329 (Why is no real title available?)
- Clique-perfectness of claw-free planar graphs
- Removable Edges in Claw-Free Bricks
- Perfect matching complexes of polygonal line tilings
- Thin edges in claw-free bricks
- Claw-free minimal matching covered graphs
- Extending unlocked matchings in graphs
- Some matching properties in \(4-\gamma_{\times 2}\)-critical graphs
This page was built for publication: Extending matchings in claw-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1322284)
