The following pages link to Connected (g, f)-factors (Q2778283):
Displaying 15 items.
- Decomposing highly edge-connected graphs into homomorphic copies of a fixed tree (Q345073) (← links)
- Decomposing highly edge-connected graphs into paths of any given length (Q345101) (← links)
- Edge-decomposition of graphs into copies of a tree with four edges (Q405153) (← links)
- A toughness condition for a spanning tree with bounded total excesses (Q497366) (← links)
- Binding numbers and connected factors (Q607686) (← links)
- Spanning trees: A survey (Q659663) (← links)
- Graph factors and factorization: 1985--2003: a survey (Q868347) (← links)
- The existence of \(f\)-forests and \(f\)-trees in graphs (Q1720317) (← links)
- Spanning trees and spanning closed walks with small degrees (Q2144593) (← links)
- On a spanning \(k\)-tree in which specified vertices have degree less than \(k\) (Q2259579) (← links)
- Spanning trees and spanning Eulerian subgraphs with small degrees (Q2342618) (← links)
- Toughness in graphs -- a survey (Q2494126) (← links)
- Balancing two spanning trees (Q3087621) (← links)
- Spanning Trees with Vertices Having Large Degrees (Q5265330) (← links)
- Toughness and spanning trees in K4‐minor‐free graphs (Q6055399) (← links)
