The following pages link to (Q4074931):
Displaying 39 items.
- Forbidden subgraphs generating a finite set (Q383734) (← 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)
- Graphs with integer matching polynomial zeros (Q526810) (← links)
- The Ryjáček closure and a forbidden subgraph (Q726640) (← links)
- Eliminating graphs by means of parallel knock-out schemes (Q867852) (← links)
- Graph factors and factorization: 1985--2003: a survey (Q868347) (← links)
- Decomposing plane cubic graphs (Q896062) (← links)
- Path factors and parallel knock-out schemes of almost claw-free graphs (Q968408) (← links)
- The strong perfect-graph conjecture is true for \(K_{1,3}\)-free graphs (Q1213881) (← links)
- On matching extensions with prescribed and proscribed edge sets. II (Q1292810) (← links)
- Odd factors of a graph (Q1313354) (← links)
- Extending matchings in graphs: A survey (Q1322235) (← links)
- Extending matchings in claw-free graphs (Q1322284) (← links)
- Dirac's minimum degree condition restricted to claws (Q1356453) (← links)
- The partition of a uniform hypergraph into pairs of dependent hyperedges (Q1356565) (← 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)
- Triangles in claw-free graphs (Q1584304) (← links)
- On barrier sets of star-factors (Q1813717) (← links)
- Forbidden induced subgraphs for perfect matchings (Q1950397) (← links)
- On cut vertices and eigenvalues of character graphs of solvable groups (Q1983117) (← links)
- Vertex-disjoint stars in \(K_{1 , r}\)-free graphs (Q2043375) (← links)
- On the number of perfect matchings in the line graph of a traceable graph (Q2112658) (← links)
- Deficiency and forbidden subgraphs of connected, locally-connected graphs (Q2282473) (← links)
- Zero forcing in claw-free cubic graphs (Q2302052) (← links)
- Set graphs. III: Proof pearl: Claw-free graphs mirrored into transitive hereditarily finite sets (Q2352482) (← links)
- Claw-free strictly Deza graphs (Q2403679) (← links)
- On matching and total domination in graphs (Q2483421) (← links)
- A pair of forbidden subgraphs and perfect matchings. (Q2490834) (← 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)
- Polynomial time algorithms for two classes of subgraph problem (Q3598037) (← links)
- On Perfect Matchings and Tilings in Uniform Hypergraphs (Q4638614) (← links)
- Forbidden subgraphs for graphs with (near) perfect matching to be hamiltonian (Q5163018) (← links)
- A survey on graphs with convex quadratic stability number (Q5207733) (← links)
- On the dimer problem of the vertex-edge graph of a cubic graph (Q6041554) (← links)
- Enumeration of perfect matchings of the middle graph of a graph \(G\) with \(\triangle (G) \leq 4\) (Q6197712) (← links)
