Graphs with 1-Factors
From MaRDI portal
Publication:4044631
DOI10.2307/2039666zbMath0293.05157OpenAlexW4251401746WikidataQ29999693 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
Related Items (49)
On component factors ⋮ Index of parameters of iterated line graphs ⋮ Construction of k-matchings in graph products ⋮ 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 ⋮ Generalization of matching extensions in graphs. IV: Closures ⋮ Equimatchable claw-free graphs ⋮ Eliminating graphs by means of parallel knock-out schemes ⋮ Unnamed Item ⋮ Claw-free strictly Deza graphs ⋮ Quasi-claw-free graphs ⋮ The multiplicity of 1-factors in total graphs ⋮ On the complexity of some edge-partition problems for graphs ⋮ On the dimer problem of the vertex-edge graph of a cubic graph ⋮ Set graphs. IV. Further connections with claw-freeness ⋮ Even cycles and perfect matchings in claw-free plane graphs ⋮ Linear‐time algorithms for eliminating claws in graphs ⋮ Some sufficient conditions for a graph with minimum degree to be \(k\)-factor-critical ⋮ Factors with red-blue coloring of claw-free graphs and cubic graphs ⋮ Enumeration of perfect matchings of the middle graph of a graph \(G\) with \(\triangle (G) \leq 4\) ⋮ Matchings in infinite graphs ⋮ A simpler proof for vertex-pancyclicity of squares of connected claw-free graphs ⋮ Extending perfect matchings to Hamiltonian cycles in line graphs ⋮ On the existence of 1-factors in partial squares of graphs ⋮ A new lower bound for the number of perfect matchings of line graph ⋮ Excessive index for mesh derived networks ⋮ On Perfect Matchings and Tilings in Uniform Hypergraphs ⋮ A new recursive theorem on \(n\)-extendibility ⋮ Maximum number of edges in claw-free graphs whose maximum degree and matching number are bounded ⋮ Perfect matchings and \(K_{1,p}\)-restricted graphs ⋮ Perfect matchings avoiding prescribed edges in a star-free graph ⋮ On some graphs with a unique perfect matching ⋮ Hamiltonicity in Partly claw-free graphs ⋮ Zero forcing in claw-free cubic graphs ⋮ Factors of claw-free graphs ⋮ On matching extensions with prescribed and proscribed edge sets. II ⋮ Closure and Hamiltonian-connectivity of claw-free graphs ⋮ Global insertion and Hamiltonicity in DCT-graphs ⋮ Triangles in claw-free graphs ⋮ Some conditions for the existence of Euler \(H\)-trails ⋮ Odd factors of a graph ⋮ Edge-disjoint 1-factors in powers of connected graphs ⋮ On the number of perfect matchings in the line graph of a traceable graph ⋮ Set graphs. III: Proof pearl: Claw-free graphs mirrored into transitive hereditarily finite sets ⋮ Extending matchings in claw-free graphs ⋮ The chromatic index of a claw-free graph whose core has maximum degree 2 ⋮ The maximum genus, matchings and the cycle space of a graph
This page was built for publication: Graphs with 1-Factors
