Katsuhiro Ota

Scopus著者プロファイル

ウェブサイトhttps://k-ris.keio.ac.jp/html/100011521_ja.html

年別の研究成果

Pureに変更を加えた場合、すぐここに表示されます。

659 被引用数
15 h-index
75 Article
2 Conference article
2 Editorial

50 - 75 / 75 件

フィルター

On minimally 3-connected graphs on a surface
Ota, K., 2002 7月, In: Electronic Notes in Discrete Mathematics. 11, p. 760 1 p.
研究成果: Article › 査読
On separable self-complementary graphs
Kawarabayashi, K. I., Nakamoto, A., Oda, Y., Ota, K., Tazawa, S. & Watanabe, M., 2002 11月 6, In: Discrete Mathematics. 257, 1, p. 165-168 4 p.
研究成果: Article › 査読

Open Access
1 被引用数 (Scopus)
On the pagenumber of complete bipartite graphs
Enomoto, H., Nakamigawa, T. & Ota, K., 1997 9月, In: Journal of Combinatorial Theory. Series B. 71, 1, p. 111-120 10 p.
研究成果: Article › 査読
35 被引用数 (Scopus)
Ore-type degree condition for heavy paths in weighted graphs
Enomoto, H., Fujisawa, J. & Ota, K., 2005 9月 6, In: Discrete Mathematics. 300, 1-3, p. 100-109 10 p.
研究成果: Article › 査読
1 被引用数 (Scopus)
Partitions of a graph into paths with prescribed endvertices and lengths
Enomoto, H. & Ota, K., 2000 6月, In: Journal of Graph Theory. 34, 2, p. 163-169 7 p.
研究成果: Article › 査読
10 被引用数 (Scopus)
Planar triangulations which quadrangulate other surfaces
Nakamoto, A., Negami, S., Ota, K. & Širáň, J., 2004 8月, In: European Journal of Combinatorics. 25, 6, p. 817-833 17 p.
研究成果: Article › 査読
6 被引用数 (Scopus)
Polynomial invariants of graphs II
Negami, S. & Ota, K., 1996 1月 1, In: Graphs and Combinatorics. 12, 2, p. 189-198 10 p.
研究成果: Article › 査読
2 被引用数 (Scopus)
Pyramidal tours with step-backs and the asymmetric traveling salesman problem
Enomoto, H., Oda, Y. & Ota, K., 1998 10月 5, In: Discrete Applied Mathematics. 87, 1-3, p. 57-65 9 p.
研究成果: Article › 査読

Open Access
10 被引用数 (Scopus)
Regular factors in K_1,n free graphs
Egawa, Y. & Ota, K., 1991, In: Journal of Graph Theory. 15, 3, p. 337-344 8 p.
研究成果: Article › 査読
32 被引用数 (Scopus)
Spanning trees in 3-connected K_3,t-minor-free graphs
Ota, K. & Ozeki, K., 2009 8月 1, In: Electronic Notes in Discrete Mathematics. 34, p. 145-149 5 p.
研究成果: Article › 査読
2 被引用数 (Scopus)
Spanning trees in 3-connected K _3,t-minor-free graphs
Ota, K. & Ozeki, K., 2012 9月, In: Journal of Combinatorial Theory. Series B. 102, 5, p. 1179-1188 10 p.
研究成果: Article › 査読
5 被引用数 (Scopus)
Spanning trees with bounded total excess
Enomoto, H., Ohnishi, Y. & Ota, K., 2011 10月 1, In: Ars Combinatoria. 102, p. 289-295 7 p.
研究成果: Article › 査読
2 被引用数 (Scopus)
Subgraphs of graphs on surfaces with high representativity
Kawarabayashi, K. I., Nakamoto, A. & Ota, K., 2003 11月, In: Journal of Combinatorial Theory. Series B. 89, 2, p. 207-229 23 p.
研究成果: Article › 査読
15 被引用数 (Scopus)
The 3‐connected graphs having a longest cycle containing only three contractible edges
Aldred, R. E. L., Hemminger, R. L. & Ota, K., 1993, In: Journal of Graph Theory. 17, 3, p. 361-371 11 p.
研究成果: Article › 査読
12 被引用数 (Scopus)
The diameters of some transition graphs constructed from Hamilton cycles
Hagita, M., Oda, Y. & Ota, K., 2002, In: Graphs and Combinatorics. 18, 1, p. 105-117 13 p.
研究成果: Article › 査読
1 被引用数 (Scopus)
The existence of a 2-factor in K_{1, n}-free graphs with large connectivity and large edge-connectivity
Aldred, R. E. L., Egawa, Y., Fujisawa, J., Ota, K. & Saito, A., 2011 9月, In: Journal of Graph Theory. 68, 1, p. 77-89 13 p.
研究成果: Article › 査読
10 被引用数 (Scopus)
The number of contractible edges in 3-connected graphs
Ota, K., 1988 12月 1, In: Graphs and Combinatorics. 4, 1, p. 333-354 22 p.
研究成果: Article › 査読
10 被引用数 (Scopus)
Toughness of K_a,t-minor-free graphs
Chen, G., Egawa, Y., Kawarabayashi, K. I., Mohar, B. & Ota, K., 2011, In: Electronic Journal of Combinatorics. 18, 1
研究成果: Article › 査読

Open Access
4 被引用数 (Scopus)
Uniform intersecting families with covering number four
Frankl, P., Ota, K. & Tokushige, N., 1995 7月, In: Journal of Combinatorial Theory, Series A. 71, 1, p. 127-145 19 p.
研究成果: Article › 査読
8 被引用数 (Scopus)
Uniform Intersecting Families with Covering Number Restrictions
Frankl, P., Ota, K. & Tokushige, N., 1998, In: Combinatorics Probability and Computing. 7, 1, p. 47-56 10 p.
研究成果: Article › 査読
2 被引用数 (Scopus)
Vertex-disjoint claws in graphs
Egawa, Y. & Ota, K., 1999 2月 28, In: Discrete Mathematics. 197-198, p. 225-246 22 p.
研究成果: Article › 査読

Open Access
7 被引用数 (Scopus)
Vertex-disjoint cycles containing specified edges in a bipartite graph
Chen, G., Enomoto, H., Kawarabayashi, K. I., Ota, K., Lou, D. & Saito, A., 2001 12月 1, In: Australasian Journal of Combinatorics. 23, p. 37-48 12 p.
研究成果: Article › 査読
5 被引用数 (Scopus)
Vertex-disjoint cycles containing specified vertices in a bipartite graph
Chen, G., Enomoto, H., Kawarabayashi, K. I., Ota, K., Lou, D. & Saito, A., 2004 7月, In: Journal of Graph Theory. 46, 3, p. 145-166 22 p.
研究成果: Article › 査読
4 被引用数 (Scopus)
Vertex-Disjoint Paths in Graphs
Egawa, Y. & Ota, K., 2001 12月 1, In: Ars Combinatoria. 61, p. 23-31 9 p.
研究成果: Article › 査読
3 被引用数 (Scopus)
Weighted Ramsey problem
Fujisawa, J. & Ota, K., 2006 12月 1, In: Australasian Journal of Combinatorics. 34, p. 331-342 12 p.
研究成果: Article › 査読
1 被引用数 (Scopus)

太田 克弘

研究成果

検索結果

太田克弘