The following pages link to Tomoki Yamashita (Q354451):
Displaying 50 items.
- Degree sum conditions for cyclability in bipartite graphs (Q354452) (← 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)
- Degree sum conditions for vertex-disjoint cycles passing through specified vertices (Q507488) (← links)
- A spanning tree with high degree vertices (Q604984) (← links)
- Degree bounded spanning trees (Q605003) (← links)
- Spanning trees: A survey (Q659663) (← links)
- Spanning trees with a bounded number of branch vertices in a claw-free graph (Q742583) (← links)
- Closure and spanning \(k\)-trees (Q742606) (← links)
- Long cycles in graphs without Hamiltonian paths (Q998320) (← links)
- On degree sum conditions for long cycles and cycles through specified vertices (Q998401) (← links)
- A degree sum condition concerning the connectivity and the independence number of a graph (Q1014827) (← links)
- Hamiltonian cycles and dominating cycles passing through a linear forest (Q1024474) (← links)
- A degree sum condition with connectivity for relative length of longest paths and cycles (Q1045188) (← links)
- Cycles within specified distance from each vertex. (Q1427481) (← links)
- A note on two geometric paths with few crossings for points labeled by integers in the plane (Q1699559) (← links)
- Degree conditions for the existence of vertex-disjoint cycles and paths: a survey (Q1706420) (← links)
- Heavy cycles in Hamiltonian weighted graphs (Q1773840) (← links)
- Length of longest cycles in a graph whose relative length is at least two (Q1928283) (← links)
- Spanning bipartite graphs with large degree sum in graphs of odd order (Q2051889) (← links)
- A Chvátal-Erdős condition for the existence of a cycle intersecting specified connected subgraphs (Q2124605) (← links)
- Spanning bipartite graphs with high degree sum in graphs (Q2279986) (← links)
- Degree sum conditions for path-factors with specified end vertices in bipartite graphs (Q2374163) (← links)
- A note on degree sum conditions for 2-factors with a prescribed number of cycles in bipartite graphs (Q2404378) (← links)
- A degree sum condition for long cycles passing through a linear forest (Q2427497) (← links)
- Edge-dominating cycles in graphs (Q2462364) (← links)
- Spanning trees with few leaves (Q2464051) (← links)
- Degree conditions on claws and modified claws for Hamiltonicity of graphs (Q2477384) (← links)
- Degree sum and connectivity conditions for dominating cycles (Q2477385) (← links)
- On a spanning tree with specified leaves (Q2482350) (← links)
- Perfect matchings avoiding prescribed edges in a star-free graph (Q2515564) (← links)
- Panconnectivity in bipartite graphs with large degree sum (Q2698541) (← links)
- Spanning Caterpillars Having at Most k Leaves (Q2864332) (← links)
- Dominating cycles in triangle-free graphs. (Q2881255) (← links)
- (Q3011709) (← links)
- (Q3178889) (← links)
- (Q3300689) (← links)
- A degree sum condition for longest cycles in 3-connected graphs (Q3437003) (← links)
- Cycles passing throughk + 1 vertices ink-connected graphs (Q3506318) (← links)
- On relative length of longest paths and cycles (Q3652557) (← links)
- On Directed 2-factors in Digraphs and 2-factors Containing Perfect Matchings in Bipartite Graphs (Q4602862) (← links)
- (Q4897473) (← links)
- A degree sum condition on the order, the connectivity and the independence number for Hamiltonicity (Q5210982) (← links)
- (Q5393530) (← links)
- (Q5442611) (← links)
- Vertex-dominating cycles in 2-connected bipartite graphs (Q5443844) (← links)
- (Q5449141) (← links)
- (Q5466015) (← links)
- (Q5480718) (← links)
