The following pages link to Kiyoshi Yoshimoto (Q293623):
Displaying 50 items.
- Locating pairs of vertices on a Hamiltonian cycle in bigraphs (Q293624) (← links)
- On spanning trees with restricted degrees (Q294729) (← links)
- Locating sets of vertices on Hamiltonian cycles (Q298964) (← links)
- 2-factors in claw-free graphs with lower bounds cycle lengths (Q489345) (← links)
- Vertex coloring of graphs by total 2-weightings (Q503639) (← links)
- 2-factors and independent sets on claw-free graphs (Q658040) (← links)
- Set-orderedness as a generalization of \(k\)-orderedness and cyclability (Q708377) (← links)
- Note on locating pairs of vertices on Hamiltonian cycles (Q742600) (← links)
- Sharp upper bounds on the minimum number of components of 2-factors in claw-free graphs (Q844222) (← links)
- Toughness and Hamiltonicity in \(k\)-trees (Q868350) (← links)
- Rainbow cycles in edge-colored graphs (Q906488) (← links)
- Closure concept for 2-factors in claw-free graphs (Q968436) (← links)
- (Q1045045) (redirect page) (← links)
- \(\lambda \)-backbone colorings along pairwise disjoint stars and matchings (Q1045046) (← links)
- The connectivities of leaf graphs of 2-connected graphs (Q1306305) (← links)
- The connectivities of leaf graphs of sets of points in the plane (Q1598367) (← links)
- A Hamilton cycle in which specified vertices are located in polar opposite (Q1691214) (← links)
- Pairs of forbidden subgraphs and 2-connected supereulerian graphs (Q1744755) (← links)
- On a 2-factor with a specified edge in a graph satisfying the Ore condition (Q1850026) (← links)
- On a Hamiltonian cycle in which specified vertices are not isolated (Q1850042) (← links)
- On geometric independency trees for points in the plane (Q1850043) (← links)
- On a Hamiltonian cycle in which specified vertices are uniformly distributed (Q1850512) (← links)
- Disjoint properly colored cycles in edge-colored complete bipartite graphs (Q2092322) (← links)
- On connectivities of edge-colored graphs (Q2104926) (← links)
- Equivalence of Jackson's and Thomassen's conjectures (Q2349510) (← links)
- A panconnectivity theorem for bipartite graphs (Q2411610) (← links)
- Edge degrees and dominating cycles (Q2427518) (← links)
- Even subgraphs of bridgeless graphs and 2-factors of line graphs (Q2461204) (← links)
- On the number of components in 2-factors of claw-free graphs (Q2461206) (← links)
- Relative length of longest paths and longest cycles in triangle-free graphs (Q2470001) (← links)
- On a spanning tree with specified leaves (Q2482350) (← links)
- 2-factors with bounded number of components in claw-free graphs (Q2514163) (← links)
- (Q2816110) (← links)
- (Q2816147) (← links)
- (Q2857347) (← links)
- Claw-free graphs and 2-factors that separate independent vertices (Q2891039) (← links)
- Heavy cycles passing through some specified vertices in weighted graphs (Q3022732) (← links)
- (Q3433933) (← links)
- The upper bound of the number of cycles in a 2-factor of a line graph (Q3445503) (← links)
- (Q3447585) (← links)
- A Relationship Between Thomassen's Conjecture and Bondy's Conjecture (Q3453562) (← links)
- On components of 2-factors in claw-free graphs (Q3503486) (← links)
- (Q3565870) (← links)
- Spanning even subgraphs of 3‐edge‐connected graphs (Q3652540) (← links)
- A 2‐factor with two components of a graph satisfying the Chvátal‐Erdös condition (Q4422614) (← links)
- ALTERNATING HAMILTON CYCLES WITH MINIMUM NUMBER OF CROSSINGS IN THE PLANE (Q4682205) (← links)
- A complete bipartite graph without properly colored cycles of length four (Q5110650) (← links)
- ${4,5}$ Is Not Coverable: A Counterexample to a Conjecture of Kaiser and Škrekovski (Q5300486) (← links)
- On Dominating Even Subgraphs in Cubic Graphs (Q5346564) (← links)
- Cycles through specified vertices in triangle-free graphs (Q5444067) (← links)
