The following pages link to The Factors of Graphs (Q5816402):
Displayed 50 items.
- Toughness of graphs and the existence of factors (Q1813740) (← links)
- On f-factors of a graph (Q1820798) (← links)
- Generalized edge packings (Q1825138) (← links)
- Packing paths of length at least two (Q1827782) (← links)
- Spanning subgraphs with specified valencies (Q1844690) (← links)
- Disconnected 2-factors in planar cubic bridgeless graphs (Q1850589) (← links)
- Complete-factors and (\(g,f\))-factors (Q1874376) (← links)
- Minimum degree, independence number and regular factors (Q1906860) (← links)
- Toughness, hamiltonicity and split graphs (Q1916113) (← links)
- Finding Hamiltonian cycles in Delaunay triangulations is NP-complete (Q1917249) (← links)
- Chordality and 2-factors in tough graphs (Q1962052) (← links)
- A factorization theorem for a certain class of graphs (Q2264778) (← links)
- Regular factors in regular graphs (Q2366028) (← links)
- Jin Akiyama: a friend and his mathematics (on the occasion of his 60th birthday) (Q2373936) (← links)
- Factors and vertex-deleted subgraphs (Q2488936) (← links)
- Spanning subgraphs with specified valencies. (Reprint) (Q2497993) (← links)
- Finding maximum square-free 2-matchings in bipartite graphs (Q2498740) (← links)
- The \(f\)-factor problem for graphs and the hereditary property (Q2505509) (← links)
- Extreme degree sequences of simple graphs (Q2562798) (← links)
- On \((g,f)\)-uniform graphs (Q2577646) (← links)
- Maximal-\(\Gamma\)-prime Graphen (Q2625678) (← links)
- (Q2741342) (← links)
- Balanced network flows. IV. Duality and structure theory (Q2744653) (← links)
- Binding number and minimum degree for k-factors (Q3035330) (← links)
- Minimum node covers and 2-bicritical graphs (Q3050138) (← links)
- Graphs and Subgraphs (Q3241661) (← links)
- Factors of Inserted Graphs (Q3429757) (← links)
- A Minimal Totally Dual Integral Defining System for the <i>b</i>-Matching Polyhedron (Q3669184) (← links)
- Factors and factorizations of graphs—a survey (Q3714113) (← links)
- Packings by Complete Bipartite Graphs (Q3728943) (← links)
- Toughness and the existence ofk-factors (Q3731636) (← links)
- Regular factors of regular graphs (Q3752417) (← links)
- Some conditions for the existence off-factors (Q3815341) (← links)
- (Q3875973) (← links)
- Optimum matching forests II: General weights (Q3922479) (← links)
- Vertices Belonging to All or to No Maximum Stable Sets of a Graph (Q3960467) (← links)
- Regular factors in <i>K</i><sub>1,3</sub>‐free graphs (Q3978368) (← links)
- [<i>a,b</i>]‐factorizations of graphs (Q3978370) (← links)
- Regular factors in <i>K</i><sub>1,<i>n</i></sub> free graphs (Q3978374) (← links)
- A degree condition for the existence ofk-factors (Q4013416) (← links)
- (Q4068761) (← links)
- Über ein graphentheoretisches Ergebnis von T. Gallai (Q4172084) (← links)
- (Q4229268) (← links)
- Path factors of bipartite graphs (Q4284102) (← links)
- Toughness, minimum degree, and the existence of 2‐factors (Q4290577) (← links)
- Toughness, minimum degree, and the existence of 2‐factors (Q4309982) (← links)
- Neighborhood unions and regular factors (Q4320465) (← links)
- Toughness, minimum degree, and spanning cubic subgraphs (Q4458596) (← links)
- (Q4540086) (← links)
- Independence number, connectivity, and r‐factors (Q4731218) (← links)