|
Search the dblp DataBase
Kiyoshi Yoshimoto:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Atsushi Kaneko, Yoshiaki Oda, Kiyoshi Yoshimoto
Some results on geometric independency trees. [Citation Graph (0, 0)][DBLP] CCCG, 1999, pp:- [Conf]
- Takayuki Nakamura, Kiyoshi Yoshimoto
Transformation of Spanning Trees in a 2-Connected Graph. [Citation Graph (0, 0)][DBLP] Ars Comb., 2001, v:60, n:, pp:- [Journal]
- Kiyoshi Yoshimoto
The Connectivities of Trunk Graphs of Connected Graphs. [Citation Graph (0, 0)][DBLP] Ars Comb., 2001, v:60, n:, pp:- [Journal]
- Atsushi Kaneko, Ken-ichi Kawarabayashi, Katsuhiro Ota, Kiyoshi Yoshimoto
On a hamiltonian cycle in which specified vertices are not isolated. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2002, v:258, n:1-3, pp:85-91 [Journal]
- Atsushi Kaneko, Yoshiaki Oda, Kiyoshi Yoshimoto
On geometric independency trees for points in the plane. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2002, v:258, n:1-3, pp:93-104 [Journal]
- Atsushi Kaneko, Kiyoshi Yoshimoto
On a 2-factor with a specified edge in a graph satisfying the Ore condition. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2002, v:257, n:2-3, pp:445-461 [Journal]
- Hajo Broersma, Liming Xiong, Kiyoshi Yoshimoto
Toughness and hamiltonicity in k-trees. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2007, v:307, n:7-8, pp:832-838 [Journal]
- Atsushi Kaneko, Mikio Kano, Kiyoshi Yoshimoto
Alternating Hamilton Cycles with Minimum Number of Crossings in the Plane. [Citation Graph (0, 0)][DBLP] Int. J. Comput. Geometry Appl., 2000, v:10, n:1, pp:73-78 [Journal]
- Atsushi Kaneko, Kiyoshi Yoshimoto
On spanning trees with restricted degrees. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2000, v:73, n:5-6, pp:163-165 [Journal]
- Atsushi Kaneko, Kiyoshi Yoshimoto
On a Hamiltonian Cycle in Which Specified Vertices Are Uniformly Distributed. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 2001, v:81, n:1, pp:100-109 [Journal]
- Atsushi Kaneko, Kiyoshi Yoshimoto
The Connectivities of Leaf Graphs of 2-Connected Graphs. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1999, v:76, n:2, pp:155-169 [Journal]
- Jun Fujisawa, Kiyoshi Yoshimoto, Shenggui Zhang
Heavy cycles passing through some specified vertices in weighted graphs. [Citation Graph (0, 0)][DBLP] Journal of Graph Theory, 2005, v:49, n:2, pp:93-103 [Journal]
On the number of components in 2-factors of claw-free graphs. [Citation Graph (, )][DBLP]
Even subgraphs of bridgeless graphs and 2-factors of line graphs. [Citation Graph (, )][DBLP]
Relative length of longest paths and longest cycles in triangle-free graphs. [Citation Graph (, )][DBLP]
Edge degrees and dominating cycles. [Citation Graph (, )][DBLP]
lambda-backbone colorings along pairwise disjoint stars and matchings. [Citation Graph (, )][DBLP]
Closure concept for 2-factors in claw-free graphs. [Citation Graph (, )][DBLP]
Set-orderedness as a generalization of k-orderedness and cyclability. [Citation Graph (, )][DBLP]
Search in 0.306secs, Finished in 0.307secs
|