The following pages link to (Q3910557):
Displaying 36 items.
- Spanning \(k\)-forests with large components in \(K_{1,k+1}\)-free graphs (Q497365) (← links)
- On factors with given components (Q594109) (← links)
- Simple neighbourhoods in triple systems (Q749540) (← links)
- Characterizations for \({\mathcal{P}}_{\geq 2}\)-factor and \({\mathcal{P}}_{\geq 3}\)-factor covered graphs (Q1025460) (← links)
- On matroids induced by packing subgraphs (Q1109053) (← links)
- Illuminating disjoint line segments in the plane (Q1434256) (← links)
- The existence of a path-factor without small odd paths (Q1753005) (← links)
- On barrier sets of star-factors (Q1813717) (← links)
- Characterizing \(\mathcal{P}_{\geqslant 2} \)-factor and \(\mathcal{P}_{\geqslant 2} \)-factor covered graphs with respect to the size or the spectral radius (Q1981717) (← links)
- The relation between Hamiltonian and 1-tough properties of the Cartesian product graphs (Q2045387) (← links)
- Toughness and isolated toughness conditions for \(P_{\ge 3}\)-factor uniform graphs (Q2053255) (← links)
- The spectral radius and \({\mathcal{P}}_{\ge \ell}\)-factors of graphs involving minimum degree (Q2093104) (← links)
- The existence of path-factor covered graphs (Q2107737) (← links)
- Path factors in subgraphs (Q2161249) (← links)
- Some existence theorems on path factors with given properties in graphs (Q2199110) (← links)
- On caterpillar factors in graphs (Q2210502) (← links)
- Binding number conditions for \(P_{\geq 2}\)-factor and \(P_{\geq 3}\)-factor uniform graphs (Q2286579) (← links)
- Jin Akiyama: a friend and his mathematics (on the occasion of his 60th birthday) (Q2373936) (← links)
- Degree sum conditions for path-factors with specified end vertices in bipartite graphs (Q2374163) (← links)
- The existence of \(P_{\geq3}\)-factor covered graphs (Q2409795) (← links)
- \(P_3\)-factors in the square of a tree (Q2657058) (← links)
- Fractional matchings, component-factors and edge-chromatic critical graphs (Q2657106) (← links)
- Packings by Complete Bipartite Graphs (Q3728943) (← links)
- (Q4711754) (← links)
- Some results about component factors in graphs (Q5242258) (← links)
- A Tutte-Type Characterization for Graph Factors (Q5267996) (← links)
- (Q5374247) (← links)
- Spectral radius and fractional perfect matchings in graphs (Q6045134) (← links)
- Fractional matching, factors and spectral radius in graphs involving minimum degree (Q6051148) (← links)
- Characterizing \(\mathcal{P}_{\geqslant 2}\)-factor deleted graphs with respect to the size or the spectral radius (Q6186333) (← links)
- Independence number and minimum degree for path-factor critical uniform graphs (Q6633529) (← links)
- On graph-based network parameters and component factors in networks (Q6658448) (← links)
- Component factors and degree sum conditions in graphs (Q6658862) (← links)
- Degree conditions for path-factors in graphs (Q6658903) (← links)
- On path-factor critical uniform graphs (Q6669293) (← links)
- Degree sum conditions for path-factor uniform graphs (Q6669307) (← links)
