The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Hikoe Enomoto: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Yoshimi Egawa, Hikoe Enomoto, Norihide Tokushige
    Graph decompositions through prescribed vertices without isolates. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2002, v:62, n:, pp:- [Journal]
  2. 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]
  3. Hikoe Enomoto, Kayo Masuda, Tomoki Nakamigawa
    Induced Graph Theorem on Magic Valuations. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2000, v:56, n:, pp:- [Journal]
  4. Yoshimi Egawa, Hikoe Enomoto, Akira Saito
    Contracible edges in triangle-free graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1986, v:6, n:3, pp:269-274 [Journal]
  5. Hikoe Enomoto
    On the Existence of Disjoint Cycles in a Graph. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1998, v:18, n:4, pp:487-492 [Journal]
  6. Hikoe Enomoto, Akira Saito
    Disjoint shortest paths in graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1984, v:4, n:4, pp:275-279 [Journal]
  7. Hikoe Enomoto, Gyula O. H. Katona
    Pairs of Disjoint q-element Subsets Far from Each Other. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2001, v:8, n:2, pp:- [Journal]
  8. Hikoe Enomoto, Miki Shimabara Miyauchi, Katsuhiro Ota
    Lower Bounds for the Number of Edge-crossings Over the Spine in a Topological Book Embedding of a Graph. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:92, n:2-3, pp:149-155 [Journal]
  9. Hikoe Enomoto, Yoshiaki Oda, Katsuhiro Ota
    Pyramidal Tours with Step-backs and the Asymmetric Traveling Salesman Problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:87, n:1-3, pp:57-65 [Journal]
  10. Hikoe Enomoto
    Graph partition problems into cycles and paths. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:233, n:1-3, pp:93-101 [Journal]
  11. 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]
  12. Hikoe Enomoto, Mariko Hagita
    Toughness and the existence of k-factors. IV. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:216, n:1-3, pp:111-120 [Journal]
  13. Hikoe Enomoto, Hao Li
    Partition of a graph into cycles and degenerated cycles. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:276, n:1-3, pp:177-181 [Journal]
  14. Hikoe Enomoto, Shinsuke Matsunaga, Katsuhiro Ota
    Graph decompositions and D3-paths with a prescribed endvertex. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:213, n:1-3, pp:87-104 [Journal]
  15. Hikoe Enomoto, Tomoki Nakamigawa
    On the decomposition dimension of trees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:252, n:1-3, pp:219-225 [Journal]
  16. Hikoe Enomoto, Kyoji Ohba, Katsuhiro Ota, Junko Sakamoto
    Choice number of some complete multi-partite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:244, n:1-3, pp:55-66 [Journal]
  17. Hikoe Enomoto, Taro Tokuda
    Complete-factors and f-factors. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:220, n:1-3, pp:239-242 [Journal]
  18. Yoshimi Egawa, Hikoe Enomoto, Stanislav Jendrol, Katsuhiro Ota, Ingo Schiermeyer
    Independence number and vertex-disjoint cycles. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:11-12, pp:1493-1498 [Journal]
  19. Kiyoshi Ando, Hikoe Enomoto, Akira Saito
    Contractible edges in 3-connected graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1987, v:42, n:1, pp:87-93 [Journal]
  20. Hikoe Enomoto
    Graph Decompositions without Isolated Vertices. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1995, v:63, n:1, pp:111-124 [Journal]
  21. Hikoe Enomoto, Mariko Hagita, Makoto Matsumoto
    A Note on Difference Sets. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1998, v:84, n:2, pp:133-144 [Journal]
  22. Hikoe Enomoto, Tadashi Iida, Katsuhiro Ota
    Connected Spanning Subgraphs of 3-Connected Planar Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1996, v:68, n:2, pp:314-323 [Journal]
  23. Hikoe Enomoto, Atsushi Kaneko, Akira Saito, Bing Wei
    Long cycles in triangle-free graphs with prescribed independence number and connectivity. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2004, v:91, n:1, pp:43-55 [Journal]
  24. Hikoe Enomoto, Masahiko Miyamoto
    On Maximal Weights of Hadamard Matrices. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1980, v:29, n:1, pp:94-100 [Journal]
  25. Hikoe Enomoto, R. A. Mena
    Distance-regular digraphs of girth 4. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1987, v:43, n:3, pp:293-302 [Journal]
  26. Hikoe Enomoto, Tomoki Nakamigawa, Katsuhiro Ota
    On the Pagenumber of Complete Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1997, v:71, n:1, pp:111-120 [Journal]
  27. Hikoe Enomoto
    Combinatorially homogeneous graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1981, v:30, n:2, pp:215-223 [Journal]
  28. Hikoe Enomoto, Mirko Hornák, Stanislav Jendrol
    Cyclic Chromatic Number of 3-Connected Plane Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2001, v:14, n:1, pp:121-137 [Journal]
  29. Hikoe Enomoto, Miki Shimabara Miyauchi
    Embedding Graphs into a Three Page Book with O(m log n) Crossings of Edges over the Spine. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1999, v:12, n:3, pp:337-341 [Journal]
  30. Guantao Chen, Hikoe Enomoto, Ken-ichi Kawarabayashi, Katsuhiro Ota, Dingjun Lou, Akira Saito
    Vertex-disjoint cycles containing specified vertices in a bipartite graph. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2004, v:46, n:3, pp:145-166 [Journal]
  31. Yoshimi Egawa, Hikoe Enomoto, Akira Saito
    Factors and induced subgraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:68, n:2-3, pp:179-189 [Journal]
  32. Jin Akiyama, Yoshimi Egawa, Hikoe Enomoto
    Preface. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:72, n:1-3, pp:1-2 [Journal]
  33. Hikoe Enomoto, Michael D. Plummer, Akira Saito
    Neighborhood unions and factor critical graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:205, n:1-3, pp:217-220 [Journal]
  34. Hikoe Enomoto
    Toughness and the existence of k-factors. III. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:189, n:1-3, pp:277-282 [Journal]
  35. Hikoe Enomoto, Hajime Mizutani, Norihide Tokushige
    A word problem in Artin semigroups. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:104, n:2, pp:159-166 [Journal]
  36. Hikoe Enomoto, Mikio Kano
    Disjoint odd integer subsets having a constant even sum. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:137, n:1-3, pp:189-193 [Journal]

Search in 0.321secs, Finished in 0.323secs
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