The following pages link to Masao Tsugaki (Q394290):
Displayed 48 items.
- Spanning \(k\)-ended trees of bipartite graphs (Q394291) (← links)
- \(m\)-dominating \(k\)-ended trees of graphs (Q400391) (← links)
- Degree sum conditions for the circumference of 4-connected graphs (Q400404) (← links)
- Long cycles in unbalanced bipartite graphs (Q427825) (← links)
- Spanning \(k\)-trees of bipartite graphs (Q490315) (← links)
- A \(k\)-tree containing specified vertices (Q604665) (← links)
- On 3-stable number conditions in \(n\)-connected claw-free graphs (Q724867) (← links)
- Closure and spanning \(k\)-trees (Q742606) (← links)
- \(m\)-dominating \(k\)-trees of graphs (Q898133) (← links)
- Interpolation theorem on degree-factors with and without specified edges (Q928542) (← links)
- A degree sum condition for graphs to be covered by two cycles (Q973109) (← links)
- Forbidden subgraphs and the existence of paths and cycles passing through specified vertices (Q998348) (← links)
- \(m\)-dominating \(k\)-ended trees of \(l\)-connected graphs (Q1680883) (← links)
- Closure and spanning trees with bounded total excess (Q2045377) (← links)
- Spanning bipartite graphs with large degree sum in graphs of odd order (Q2051889) (← links)
- Rainbow and properly colored spanning trees in edge-colored bipartite graphs (Q2051897) (← links)
- A Chvátal-Erdős condition for the existence of a cycle intersecting specified connected subgraphs (Q2124605) (← links)
- A note on a spanning 3-tree (Q2149492) (← links)
- Color degree sum conditions for properly colored spanning trees in edge-colored graphs (Q2198384) (← links)
- Spanning bipartite graphs with high degree sum in graphs (Q2279986) (← links)
- A degree sum condition for the existence of an \(S\)-path-system in a bipartite graph (Q2319727) (← links)
- Degree sum conditions for path-factors with specified end vertices in bipartite graphs (Q2374163) (← links)
- A note on a spanning \((\alpha ,\beta )\)-ended tree in a bipartite graph (Q2413635) (← links)
- Spanning trees with few leaves (Q2464051) (← links)
- Panconnectivity in bipartite graphs with large degree sum (Q2698541) (← links)
- (Q2829073) (← links)
- Improved Upper Bounds for Gallai-Ramsey Numbers of Paths and Cycles (Q2874090) (← links)
- (Q2936733) (← links)
- SPANNING k-ENDED TREES OF A CLAW-FREE GRAPH (Q2968228) (← links)
- (Q3011709) (← links)
- (Q3025204) (← links)
- (Q3300689) (← links)
- (Q3515373) (← links)
- Pairs of forbidden class of subgraphs concerning K<sub>1,3</sub>and P<sub>6</sub>to have a cycle containing specified vertices (Q3560788) (← links)
- (Q3624968) (← links)
- On relative length of longest paths and cycles (Q3652557) (← links)
- (Q4818462) (← links)
- (Q4824930) (← links)
- (Q4982929) (← links)
- A degree sum condition on the order, the connectivity and the independence number for Hamiltonicity (Q5210982) (← links)
- (Q5393530) (← links)
- (Q5393539) (← links)
- (Q5449141) (← links)
- (Q5480718) (← links)
- A degree condition for cycles passing through specified vertices and edges (Q6056727) (← links)
- (Q6072062) (← links)
- Hamilton cycles passing through a matching in a bipartite graph with high degree sum (Q6080149) (← links)
- A spanning tree with at most \(k\) leaves in a \(K_{1,p}\)-free graph (Q6117248) (← links)