The following pages link to Tsuyoshi Nishimura (Q675893):
Displaying 20 items.
- A new recursive theorem on \(n\)-extendibility (Q675894) (← links)
- Regular factors of line graphs (Q750467) (← links)
- Short cycles in digraphs (Q1112060) (← links)
- An Ore-type condition for the existence of \(k\)-factors in graphs (Q1180675) (← links)
- A degree condition for the existence of 1-factors in graphs or their complements (Q1301648) (← links)
- Two recursive theorems on \(n\)-extendibility (Q1356686) (← links)
- Neighborhood conditions and \(k\)-factors (Q1382850) (← links)
- On 1-factors and matching extension (Q1579574) (← links)
- A closure concept in factor-critical graphs (Q1861227) (← links)
- On packing 3-vertex paths in a graph (Q2725320) (← links)
- (Q3025211) (← links)
- (Q3474680) (← links)
- (Q3988774) (← links)
- A degree condition for the existence ofk-factors (Q4013416) (← links)
- (Q4326183) (← links)
- (Q4326198) (← links)
- (Q4326749) (← links)
- (Q4488558) (← links)
- Independence number, connectivity, and r‐factors (Q4731218) (← links)
- Component factors and induced subgraphs (Q4892353) (← links)
