The following pages link to The Factors of Graphs (Q5816402):
Displayed 50 items.
- 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)
- On the use of augmenting chains in chain packings (Q1174179) (← links)
- An Ore-type condition for the existence of \(k\)-factors in graphs (Q1180675) (← links)
- One-factors and \(k\)-factors (Q1182870) (← links)
- On some factor theorems of graphs (Q1185099) (← links)
- Infinite matching theory (Q1191911) (← links)
- Binding numbers and \(f\)-factors of graphs (Q1193563) (← links)
- Compatible 2-factors (Q1193724) (← links)
- Matching theory -- a sampler: From Dénes König to the present (Q1198643) (← links)
- Factors in graphs with odd-cycle property (Q1210551) (← links)
- An extension of Tutte's 1-factor theorem (Q1256496) (← links)
- Über ein graphentheoretisches Problem von T. Gallai (Q1257027) (← links)
- Factors of trees (Q1331986) (← links)
- Regular factors in vertex-deleted subgraphs of regular graphs (Q1331993) (← links)
- Connected \([k,k+1]\)-factors of graphs (Q1357718) (← links)
- List edge and list total colourings of multigraphs (Q1366604) (← links)
- A characterization of graphs having all \((g,f)\)-factors (Q1366610) (← links)
- The membership problem in jump systems (Q1369649) (← links)
- Maximum balanced flow in a network (Q1569079) (← links)
- Regular factors of simple regular graphs and factor-spectra (Q1584246) (← links)
- Matchings and matching extensions in graphs (Q1584277) (← links)
- \(k\)-regular factors and semi-\(k\)-regular factors in graphs (Q1584278) (← links)
- Sufficient conditions for the existence of pseudo 2-factors without isolated vertices and small odd cycles (Q1637143) (← links)
- Degree conditions for the existence of vertex-disjoint cycles and paths: a survey (Q1706420) (← links)
- On barrier sets of star-factors (Q1813717) (← links)