Graphs with 1-Factors
From MaRDI portal
Publication:4044631
DOI10.2307/2039666zbMath0293.05157WikidataQ29999693 ScholiaQ29999693MaRDI QIDQ4044631
Publication date: 1974
Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2039666
05C99: Graph theory
Related Items
The maximum genus, matchings and the cycle space of a graph, A new recursive theorem on \(n\)-extendibility, Eliminating graphs by means of parallel knock-out schemes, On component factors, The multiplicity of 1-factors in total graphs, On matching extensions with prescribed and proscribed edge sets. II, Closure and Hamiltonian-connectivity of claw-free graphs, Odd factors of a graph, Extending matchings in claw-free graphs, Dirac's minimum degree condition restricted to claws, Two recursive theorems on \(n\)-extendibility, Claw-free graphs---a survey, Matching extension in \(K_{1,r}\)-free graphs with independent claw centers, Quasi-claw-free graphs, Global insertion and Hamiltonicity in DCT-graphs, Triangles in claw-free graphs, On the complexity of some edge-partition problems for graphs, Hamiltonicity in Partly claw-free graphs, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item