1-Factors and Antifactor Sets
From MaRDI portal
Publication:4105704
DOI10.1112/jlms/s2-13.2.351zbMath0338.05118OpenAlexW2005038935MaRDI QIDQ4105704
Publication date: 1976
Published in: Journal of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1112/jlms/s2-13.2.351
Related Items
The existence of a 2-factor in K1, n-free graphs with large connectivity and large edge-connectivity ⋮ Dirac's minimum degree condition restricted to claws ⋮ The partition of a uniform hypergraph into pairs of dependent hyperedges ⋮ Claw-free graphs---a survey ⋮ Matching extension in \(K_{1,r}\)-free graphs with independent claw centers ⋮ Graph factors and factorization: 1985--2003: a survey ⋮ Vertex disjoint copies of \(K_{1 , 4}\) in claw-free graphs ⋮ Matchings in 3-vertex-critical graphs: the odd case ⋮ Forbidden subgraphs generating a finite set ⋮ Even cycles and perfect matchings in claw-free plane graphs ⋮ Decomposing plane cubic graphs ⋮ A pair of forbidden subgraphs and perfect matchings in graphs of high connectivity ⋮ Forbidden induced subgraphs for perfect matchings ⋮ Toughness and matching extension in \({\mathcal{P}_3}\)-dominated graphs ⋮ Some general constructions of geodetic blocks ⋮ Edge $k$-$q$-Colorability of Graphs ⋮ Vertex-disjoint copies of \(K_{1, t}\) in \(K_{1, r}\)-free graphs ⋮ Forbidden triples for perfect matchings ⋮ Forbidden subgraphs for graphs with (near) perfect matching to be hamiltonian ⋮ Perfect matchings and \(K_{1,p}\)-restricted graphs ⋮ Vertex-disjoint copies of \(K_{1}+(K_{1} \cup K_{2}\)) in claw-free graphs ⋮ Graphs with integer matching polynomial zeros ⋮ On matching and total domination in graphs ⋮ Path factors and parallel knock-out schemes of almost claw-free graphs ⋮ A pair of forbidden subgraphs and perfect matchings. ⋮ Domination critical graphs ⋮ Critical concepts in domination ⋮ Deficiency and forbidden subgraphs of connected, locally-connected graphs ⋮ The Ryjáček closure and a forbidden subgraph ⋮ Vertex-disjoint copies of \(K_{1,3}\) in \(K_{1,r}\)-free graphs ⋮ Vertex-disjoint stars in \(K_{1 , r}\)-free graphs ⋮ Hamiltonicity in Partly claw-free graphs ⋮ Perfect Matchings Avoiding Several Independent Edges in a Star-Free Graph ⋮ On graphs with the smallest eigenvalue at least −1 − √2, part III ⋮ On barrier sets of star-factors ⋮ Global insertion and Hamiltonicity in DCT-graphs ⋮ Matchings and matching extensions in graphs ⋮ Odd factors of a graph ⋮ Extending matchings in claw-free graphs
