The following pages link to Graphs with 1-Factors (Q4044631):
Displaying 49 items.
- Generalization of matching extensions in graphs. IV: Closures (Q343759) (← links)
- Set graphs. IV. Further connections with claw-freeness (Q400530) (← links)
- A simpler proof for vertex-pancyclicity of squares of connected claw-free graphs (Q442331) (← links)
- A new lower bound for the number of perfect matchings of line graph (Q477656) (← links)
- Excessive index for mesh derived networks (Q491612) (← links)
- Maximum number of edges in claw-free graphs whose maximum degree and matching number are bounded (Q512562) (← links)
- A new recursive theorem on \(n\)-extendibility (Q675894) (← links)
- Eliminating graphs by means of parallel knock-out schemes (Q867852) (← links)
- On component factors (Q1078207) (← links)
- The multiplicity of 1-factors in total graphs (Q1123908) (← links)
- On matching extensions with prescribed and proscribed edge sets. II (Q1292810) (← links)
- Closure and Hamiltonian-connectivity of claw-free graphs (Q1296972) (← links)
- Odd factors of a graph (Q1313354) (← links)
- Extending matchings in claw-free graphs (Q1322284) (← links)
- Dirac's minimum degree condition restricted to claws (Q1356453) (← links)
- Two recursive theorems on \(n\)-extendibility (Q1356686) (← links)
- Claw-free graphs---a survey (Q1356695) (← links)
- Matching extension in \(K_{1,r}\)-free graphs with independent claw centers (Q1356714) (← links)
- Quasi-claw-free graphs (Q1377703) (← links)
- Global insertion and Hamiltonicity in DCT-graphs (Q1584209) (← links)
- Triangles in claw-free graphs (Q1584304) (← links)
- Equimatchable claw-free graphs (Q1660273) (← links)
- On some graphs with a unique perfect matching (Q1799576) (← links)
- On the complexity of some edge-partition problems for graphs (Q1923590) (← links)
- Perfect matchings and \(K_{1,p}\)-restricted graphs (Q1996835) (← links)
- On the number of perfect matchings in the line graph of a traceable graph (Q2112658) (← links)
- Index of parameters of iterated line graphs (Q2142662) (← links)
- Extending perfect matchings to Hamiltonian cycles in line graphs (Q2223459) (← links)
- Zero forcing in claw-free cubic graphs (Q2302052) (← links)
- Some conditions for the existence of Euler \(H\)-trails (Q2334082) (← links)
- Set graphs. III: Proof pearl: Claw-free graphs mirrored into transitive hereditarily finite sets (Q2352482) (← links)
- The chromatic index of a claw-free graph whose core has maximum degree 2 (Q2354597) (← links)
- Claw-free strictly Deza graphs (Q2403679) (← links)
- Perfect matchings avoiding prescribed edges in a star-free graph (Q2515564) (← links)
- Even cycles and perfect matchings in claw-free plane graphs (Q3386627) (← links)
- Hamiltonicity in Partly claw-free graphs (Q3621979) (← links)
- Edge-disjoint 1-factors in powers of connected graphs (Q3762354) (← links)
- (Q3859823) (← links)
- Matchings in infinite graphs (Q4173401) (← links)
- On the existence of 1-factors in partial squares of graphs (Q4187863) (← links)
- Factors of claw-free graphs (Q4290248) (← links)
- The maximum genus, matchings and the cycle space of a graph (Q4515306) (← links)
- On Perfect Matchings and Tilings in Uniform Hypergraphs (Q4638614) (← links)
- Construction of k-matchings in graph products (Q5058206) (← links)
- On the dimer problem of the vertex-edge graph of a cubic graph (Q6041554) (← links)
- Linear‐time algorithms for eliminating claws in graphs (Q6082274) (← links)
- Some sufficient conditions for a graph with minimum degree to be \(k\)-factor-critical (Q6124438) (← links)
- Factors with red-blue coloring of claw-free graphs and cubic graphs (Q6166670) (← links)
- Enumeration of perfect matchings of the middle graph of a graph \(G\) with \(\triangle (G) \leq 4\) (Q6197712) (← links)
