The following pages link to Graphs and Subgraphs (Q3241661):
Displaying 16 items.
- Extensions to 2-factors in bipartite graphs (Q396808) (← links)
- Generalizations of marriage theorem for degree factors (Q503622) (← links)
- Faktorklassen in Graphen (Q772016) (← links)
- Regular factors in nearly regular graphs (Q795844) (← links)
- The Edmonds-Gallai decomposition for matchings in locally finite graphs (Q1053712) (← links)
- On some factor theorems of graphs (Q1185099) (← links)
- Connected \(k\)-factors in bipartite graphs (Q2092400) (← links)
- The circular law for random regular digraphs (Q2291966) (← links)
- On the zero-sum group-magicness of Cartesian products (Q2292575) (← links)
- Fractional matching preclusion number of graphs and the perfect matching polytope (Q2307510) (← links)
- Tough graphs and Hamiltonian circuits. (Reprint) (Q2497990) (← links)
- Tough graphs and Hamiltonian circuits. (Q2558871) (← links)
- Maximal-\(\Gamma\)-prime Graphen (Q2625678) (← links)
- Ryser's theorem for \(\rho\)-Latin rectangles (Q2672929) (← links)
- Proper orientations and proper chromatic number (Q6038578) (← links)
- Some sufficient conditions for a graph with minimum degree to be \(k\)-factor-critical (Q6124438) (← links)
