Extending matchings in claw-free graphs
From MaRDI portal
Publication:1322284
DOI10.1016/0012-365X(94)90171-6zbMath0798.05041MaRDI QIDQ1322284
Publication date: 20 October 1994
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items
On cycle-nice claw-free graphs ⋮ Claw-free graphs---a survey ⋮ Matching extension in \(K_{1,r}\)-free graphs with independent claw centers ⋮ Total coloring of claw-free planar graphs ⋮ Clique-transversal sets and clique-coloring in planar graphs ⋮ Matching properties in domination critical graphs. ⋮ Extending perfect matchings to Hamiltonian cycles in line graphs ⋮ 3-factor-criticality in domination critical graphs ⋮ Clique-perfectness of claw-free planar graphs ⋮ Some matching properties in \(4-\gamma_{\times 2}\)-critical graphs ⋮ Minimal claw-free graphs ⋮ Forbidden pairs for the matching extendability of graphs with connectivity at least 2 or 3 ⋮ On matching extensions with prescribed and proscribed edge sets. II ⋮ Matchings and matching extensions in graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The complexity of computing the permanent
- Extending matchings in planar graphs. IV
- Matching theory
- Matching extension and the genus of a graph
- On maximal independent sets of vertices in claw-free graphs
- On n-extendable graphs
- Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé
- The strong perfect-graph conjecture is true for \(K_{1,3}\)-free graphs
- Connected, locally 2-connected,K1,3-free graphs are panconnected
- Claw‐free graphs are edge reconstructible
- The Complexity of Enumeration and Reliability Problems
- Every connected, locally connected nontrivial graph with no induced claw is hamiltonian
- Graphs with 1-Factors
- 1-Factors and Antifactor Sets
