The SCEAS System
Navigation Menu

Search the dblp DataBase


Jun Fujisawa: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Hikoe Enomoto, Jun Fujisawa, Katsuhiro Ota
    A sk type condition for heavy cycles in weighted graphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2005, v:76, n:, pp:- [Journal]
  2. Hikoe Enomoto, Jun Fujisawa, Katsuhiro Ota
    Ore-type degree condition for heavy paths in weighted graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:300, n:1-3, pp:100-109 [Journal]
  3. Jun Fujisawa
    Heavy fans, cycles and paths in weighted graphs of large connectivity. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:1, pp:38-53 [Journal]
  4. Jun Fujisawa
    Claw Conditions for Heavy Cycles in Weighted Graphs. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2005, v:21, n:2, pp:217-229 [Journal]
  5. 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]

  6. Degree conditions on claws and modified claws for hamiltonicity of graphs. [Citation Graph (, )][DBLP]

  7. A degree sum condition for long cycles passing through a linear forest. [Citation Graph (, )][DBLP]

  8. Forbidden subgraphs and the existence of paths and cycles passing through specified vertices. [Citation Graph (, )][DBLP]

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

  10. Weighted degrees and heavy cycles in weighted graphs. [Citation Graph (, )][DBLP]

Search in 0.002secs, Finished in 0.002secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
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 [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002