The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Katsuhiro Ota: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Nathaniel Dean, Katsuhiro Ota
    2-factors, connectivity, and graph minors. [Citation Graph (0, 0)][DBLP]
    Graph Structure Theory, 1991, pp:381-386 [Conf]
  2. Yoshimi Egawa, Katsuhiro Ota
    Vertex-Disjoint Paths in Graphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2001, v:61, n:, pp:- [Journal]
  3. 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]
  4. Atsuhiro Nakamoto, Katsuhiro Ota, Mamoru Watanabe
    On 3-coloring of plane triangulations. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2005, v:75, n:, pp:- [Journal]
  5. Yoshimi Egawa, Katsuhiro Ota, Akira Saito, Xingxing Yu
    Non-Contractible Edges in A 3-Connected Graph. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1995, v:15, n:3, pp:357-364 [Journal]
  6. Peter Frankl, Katsuhiro Ota, Norihide Tokushige
    Uniform Intersecting Families with Covering Number Restrictions. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1998, v:7, n:1, pp:47-56 [Journal]
  7. 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]
  8. 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]
  9. 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]
  10. 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]
  11. 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]
  12. 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]
  13. Ken-ichi Kawarabayashi, Atsuhiro Nakamoto, Yoshiaki Oda, Katsuhiro Ota, Shinsei Tazawa, Mamoru Watanabe
    On separable self-complementary graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:257, n:1, pp:165-168 [Journal]
  14. Ken-ichi Kawarabayashi, Katsuhiro Ota, Akira Saito
    Hamiltonian cycles in n-factor-critical graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:240, n:1-3, pp:71-82 [Journal]
  15. Atsuhiro Nakamoto, Seiya Negami, Katsuhiro Ota
    Chromatic numbers and cycle parities of quadrangulations on nonorientable closed surfaces. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:285, n:1-3, pp:211-218 [Journal]
  16. 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]
  17. Atsuhiro Nakamoto, Seiya Negami, Katsuhiro Ota, Jozef Sirán
    Planar triangulations which quadrangulate other surfaces. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2004, v:25, n:6, pp:817-833 [Journal]
  18. Mariko Hagita, Yoshiaki Oda, Katsuhiro Ota
    The Diameters of Some Transition Graphs Constructed from Hamilton Cycles. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2002, v:18, n:1, pp:105-117 [Journal]
  19. Ryuichi Mori, Atsuhiro Nakamoto, Katsuhiro Ota
    Diagonal Flips in Hamiltonian Triangulations on the Sphere. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2003, v:19, n:3, pp:413-418 [Journal]
  20. 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]
  21. 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]
  22. Peter Frankl, Katsuhiro Ota, Norihide Tokushige
    Uniform Intersecting Families with Covering Number Four. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1995, v:71, n:1, pp:127-145 [Journal]
  23. Peter Frankl, Katsuhiro Ota, Norihide Tokushige
    Exponents of Uniform L-Systems. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1996, v:75, n:1, pp:23-43 [Journal]
  24. Peter Frankl, Katsuhiro Ota, Norihide Tokushige
    Covers in Uniform Intersecting Families and a Counterexample to a Conjecture of Lovász. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1996, v:74, n:1, pp:33-42 [Journal]
  25. Atsushi Kaneko, Katsuhiro Ota
    On Minimally (n, )-Connected Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2000, v:80, n:1, pp:156-171 [Journal]
  26. Ken-ichi Kawarabayashi, Atsuhiro Nakamoto, Katsuhiro Ota
    Subgraphs of graphs on surfaces with high representativity . [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2003, v:89, n:2, pp:207-229 [Journal]
  27. Hiroshi Maehara, Katsuhiro Ota, Norihide Tokushige
    Every Graph Is an Integral Distance Graph in the Plane. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1997, v:80, n:2, pp:290-294 [Journal]
  28. William McCuaig, Katsuhiro Ota
    Contractile Triples in 3-Connected Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1994, v:60, n:2, pp:308-314 [Journal]
  29. Atsuhiro Nakamoto, Katsuhiro Ota
    Diagonal Transformations of Graphs and Dehn Twists of Surfaces. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1997, v:70, n:2, pp:292-300 [Journal]
  30. Atsuhiro Nakamoto, Katsuhiro Ota
    Diagonal Transformations in Quadrangulations and Dehn Twists Preserving Cycle Parities. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1997, v:69, n:2, pp:125-141 [Journal]
  31. Shinya Fujita, Ken-ichi Kawarabayashi, Cláudio Leonardo Lucchesi, Katsuhiro Ota, Michael D. Plummer, Akira Saito
    A pair of forbidden subgraphs and perfect matchings. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2006, v:96, n:3, pp:315-324 [Journal]
  32. 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]
  33. Yoshimi Egawa, Katsuhiro Ota
    Vertex-disjoint claws in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:197, n:, pp:225-246 [Journal]
  34. Katsuhiro Ota
    Cycles through prescribed vertices with large degree sum. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:145, n:1-3, pp:201-210 [Journal]

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


  36. K1, 3-factors in graphs. [Citation Graph (, )][DBLP]


  37. 3-trees with few vertices of degree 3 in circuit graphs. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.004secs
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