The following pages link to The Factors of Graphs (Q5816402):
Displaying 50 items.
- The 3-flow conjecture, factors modulo \(k\), and the 1-2-3-conjecture (Q326818) (← links)
- An existence theorem on fractional deleted graphs (Q343264) (← links)
- A note on semi-coloring of graphs (Q354428) (← links)
- \(f\)-factors, complete-factors, and component-deleted subgraphs (Q392640) (← links)
- Regular factors and eigenvalues of regular graphs (Q404439) (← links)
- Optimal covers with Hamilton cycles in random graphs (Q484550) (← links)
- On the factor-thickness of regular graphs (Q583237) (← links)
- On factors with given components (Q594109) (← links)
- Induced graph packing problems (Q604669) (← links)
- Vertex-deleted subgraphs and regular factors from regular graph (Q641166) (← links)
- The existence of \(k\)-factors in squares of graphs (Q712263) (← links)
- Edge-disjoint Hamilton cycles in graphs (Q713971) (← links)
- Paths and cycles concerning independence edges (Q757417) (← links)
- Odd path packings (Q757435) (← links)
- Faktorklassen in Graphen (Q772016) (← links)
- Critical graphs, matchings and tours or a hierarchy of relaxations for the travelling salesman problem (Q790834) (← links)
- On certain classes of fractional matchings (Q798265) (← links)
- Sufficient conditions for a graph to have factors (Q803162) (← links)
- Graph factors and factorization: 1985--2003: a survey (Q868347) (← links)
- \(k\) -factors in regular graphs (Q943560) (← links)
- On multicolour noncomplete Ramsey graphs of star graphs (Q947133) (← links)
- Approximation algorithm for maximum edge coloring (Q1007243) (← links)
- Packing trees with constraints on the leaf degree (Q1014830) (← links)
- The stability number and connected \([k,k+1]\)-factor in graphs (Q1023082) (← links)
- Degree condition for the existence of a \(k\)-factor containing a given Hamiltonian cycle (Q1025493) (← links)
- Degree and stability number condition for the existence of connected factors in graphs (Q1032554) (← links)
- Bounds on maximum \(b\)-matchings (Q1043589) (← links)
- Minimal 2-matching-covered graphs (Q1043944) (← links)
- Coloring by two-way independent sets (Q1044959) (← links)
- 4-factors in 2-connected star-free graphs (Q1045021) (← links)
- Linear-time certifying algorithms for near-graphical sequences (Q1045061) (← links)
- The method of alternating paths (Q1050374) (← links)
- Disjoint paths in a rectilinear grid (Q1051655) (← links)
- Minimum degree of a graph and the existence of k-factors (Q1071789) (← links)
- Factors of regular graphs (Q1074601) (← links)
- Parity results on connected f-factors (Q1076695) (← links)
- The number of trees with a 1-factor (Q1085165) (← links)
- General factors of graphs (Q1085185) (← links)
- Fractional matchings and the Edmonds-Gallai theorem (Q1098861) (← links)
- Matchings in infinite graphs (Q1101134) (← links)
- Constructing a perfect matching is in random NC (Q1103639) (← links)
- Toughness and the existence of k-factors. II (Q1106860) (← links)
- A graphical proof of the nonexistence of BIB(7,b,r,3,\(\lambda\) \(| 16)\) designs (Q1113910) (← links)
- Factors and induced subgraphs (Q1120595) (← links)
- A matching problem with side conditions (Q1145707) (← links)
- f-factors and related decompositions of graphs (Q1147717) (← links)
- Subgraphs and their degree sequences of a digraph (Q1148915) (← links)
- Generalized 1-factorization of trees (Q1151908) (← links)
- Graph factors (Q1168989) (← links)
- Trees with 1-factors and oriented trees (Q1174177) (← links)
