The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Kiyoshi Yoshimoto: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Atsushi Kaneko, Yoshiaki Oda, Kiyoshi Yoshimoto
    Some results on geometric independency trees. [Citation Graph (0, 0)][DBLP]
    CCCG, 1999, pp:- [Conf]
  2. 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]
  3. Kiyoshi Yoshimoto
    The Connectivities of Trunk Graphs of Connected Graphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2001, v:60, n:, pp:- [Journal]
  4. 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]
  5. 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]
  6. 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]
  7. 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]
  8. 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]
  9. 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]
  10. 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]
  11. 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]
  12. 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]

  13. On the number of components in 2-factors of claw-free graphs. [Citation Graph (, )][DBLP]


  14. Even subgraphs of bridgeless graphs and 2-factors of line graphs. [Citation Graph (, )][DBLP]


  15. Relative length of longest paths and longest cycles in triangle-free graphs. [Citation Graph (, )][DBLP]


  16. Edge degrees and dominating cycles. [Citation Graph (, )][DBLP]


  17. lambda-backbone colorings along pairwise disjoint stars and matchings. [Citation Graph (, )][DBLP]


  18. Closure concept for 2-factors in claw-free graphs. [Citation Graph (, )][DBLP]


  19. Set-orderedness as a generalization of k-orderedness and cyclability. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002