メインナビゲーションにスキップ
検索にスキップ
メインコンテンツにスキップ
Keio University ホーム
ヘルプ&FAQ
English
日本語
ホーム
プロファイル
研究部門
研究成果
専門知識、名前、または所属機関で検索
Scopus著者プロファイル
太田 克弘
数理科学科
ウェブサイト
https://k-ris.keio.ac.jp/html/100011521_ja.html
652
被引用数
出典: Scopus
15
h-index
Pureの文献数とScopusの被引用数に基づいて算出されます
1988 …
2021
年別の研究成果
概要
フィンガープリント
ネットワーク
研究成果
(79)
類似のプロファイル
(6)
Pureに変更を加えた場合、すぐここに表示されます。
研究成果
年別の研究成果
1988
1995
1996
1997
2001
2002
2011
2012
2021
652
被引用数
15
h-index
75
Article
2
Conference article
2
Editorial
年別の研究成果
年別の研究成果
50 - 75 / 75 件
出版年、タイトル
(降順)
出版年、タイトル
(昇順)
タイトル
タイプ
フィルター
Article
検索結果
1999
Connected subgraphs with small degree sums in 3-connected planar graphs
Enomoto, H.
&
Ota, K.
,
1999 3月
,
In:
Journal of Graph Theory.
30
,
3
,
p. 191-203
13 p.
研究成果
:
Article
›
査読
Degree Sum
100%
Planar graph
68%
Subgraph
62%
Connected graph
61%
Decompose
12%
11
被引用数 (Scopus)
Lower bounds for the number of edge-crossings over the spine in a topological book embedding of a graph
Enomoto, H.
,
Miyauchi, M. S.
&
Ota, K.
,
1999 6月
,
In:
Discrete Applied Mathematics.
92
,
2-3
,
p. 149-155
7 p.
研究成果
:
Article
›
査読
Open Access
Book Embedding
100%
Spine
84%
Lower bound
42%
Graph in graph theory
29%
Drawing
15%
24
被引用数 (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
Claw
100%
Disjoint
56%
Minimum Degree
49%
Vertex of a graph
40%
Graph in graph theory
32%
7
被引用数 (Scopus)
1998
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
Asymmetric Traveling Salesman Problem
100%
Distance Matrix
83%
Traveling salesman problem
80%
Travelling salesman problems
73%
Polynomial time
53%
10
被引用数 (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
›
査読
Intersecting Family
100%
Covering number
91%
Cover
53%
Restriction
49%
Upper bound
15%
2
被引用数 (Scopus)
1997
Diagonal Transformations in Quadrangulations and Dehn Twists Preserving Cycle Parities
Nakamoto, A.
&
Ota, K.
,
1997 3月
,
In:
Journal of Combinatorial Theory. Series B.
69
,
2
,
p. 125-141
17 p.
研究成果
:
Article
›
査読
Dehn Twist
100%
Quadrangulation
99%
Parity
71%
Cycle
49%
Isotopy
42%
11
被引用数 (Scopus)
Diagonal transformations of graphs and dehn twists of surfaces
Nakamoto, A.
&
Ota, K.
,
1997 7月
,
In:
Journal of Combinatorial Theory. Series B.
70
,
2
,
p. 292-300
9 p.
研究成果
:
Article
›
査読
Open Access
Dehn Twist
100%
Quadrangulation
49%
Isotopy
42%
Closed
41%
Triangulation
33%
13
被引用数 (Scopus)
Every Graph Is an Integral Distance Graph in the Plane
Maehara, H.
,
Ota, K.
&
Tokushige, N.
,
1997 11月
,
In:
Journal of Combinatorial Theory. Series A.
80
,
2
,
p. 290-294
5 p.
研究成果
:
Article
›
査読
Integral Graphs
100%
Distance Graph
93%
Finite Graph
68%
Simple Graph
63%
Adjacent
56%
5
被引用数 (Scopus)
Long Cycles Passing Through a Specified Edge in a 3-Connected Graph
Enomoto, H.
,
Hirohata, K.
&
Ota, K.
,
1997 3月
,
In:
Journal of Graph Theory.
24
,
3
,
p. 275-279
5 p.
研究成果
:
Article
›
査読
Long Cycle
100%
Connected graph
62%
Cycle
26%
Theorem
15%
2
被引用数 (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
›
査読
Complete Bipartite Graph
100%
Thing
89%
Upper bound
58%
33
被引用数 (Scopus)
1996
A Degree Condition for the Existence of Regular Factors in K
1
,
n
-Free Graphs
Ota, K.
&
Tokuda, T.
,
1996 5月
,
In:
Journal of Graph Theory.
22
,
1
,
p. 59-64
6 p.
研究成果
:
Article
›
査読
Degree Condition
100%
Minimum Degree
79%
Induced Subgraph
76%
Connected graph
61%
Odd
54%
17
被引用数 (Scopus)
Connected spanning subgraphs of 3-connected planar graphs
Enomoto, H.
,
Iida, T.
&
Katsuhiro, O.
,
1996 11月
,
In:
Journal of Combinatorial Theory. Series B.
68
,
2
,
p. 314-323
10 p.
研究成果
:
Article
›
査読
Spanning Subgraph
100%
Minimum Degree
85%
Planar graph
75%
Connected graph
67%
5
被引用数 (Scopus)
Covers in uniform intersecting families and a counterexample to a conjecture of Lovász
Frankl, P.
,
Ota, K.
&
Tokushige, N.
,
1996 4月
,
In:
Journal of Combinatorial Theory. Series A.
74
,
1
,
p. 33-42
10 p.
研究成果
:
Article
›
査読
Intersecting Family
100%
Covering number
91%
Counterexample
61%
Cover
53%
Ring or annulus
39%
18
被引用数 (Scopus)
Exponents of uniform L-systems
Frankl, P.
,
Ota, K.
&
Tokushige, N.
,
1996 7月
,
In:
Journal of Combinatorial Theory. Series A.
75
,
1
,
p. 23-43
21 p.
研究成果
:
Article
›
査読
L-system
100%
Steiner System
92%
Refinement
59%
Exponent
53%
Necessary
46%
7
被引用数 (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
›
査読
Polynomial Invariants
100%
Polynomial
40%
Graph in graph theory
35%
Tutte Polynomial
33%
Computer Experiments
32%
2
被引用数 (Scopus)
1995
Cycles through prescribed vertices with large degree sum
Ota, K.
,
1995 10月 13
,
In:
Discrete Mathematics.
145
,
1-3
,
p. 201-210
10 p.
研究成果
:
Article
›
査読
Degree Sum
100%
Connected graph
61%
Cycle
53%
Lower bound
25%
Denote
23%
32
被引用数 (Scopus)
Non-contractible edges in a 3-connected graph
Egawa, Y.
,
Ota, K.
,
Saito, A.
&
Yu, X.
,
1995 9月 1
,
In:
Combinatorica.
15
,
3
,
p. 357-364
8 p.
研究成果
:
Article
›
査読
Connected graph
100%
Contraction
34%
Upper bound
26%
3
被引用数 (Scopus)
Note on irreducible triangulations of surfaces
Nakamoto, A.
&
Ota, K.
,
1995
,
In:
Journal of Graph Theory.
20
,
2
,
p. 227-233
7 p.
研究成果
:
Article
›
査読
Triangulation
100%
Genus
84%
Closed
61%
40
被引用数 (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
›
査読
Intersecting Family
100%
Covering number
91%
Counterexample
61%
Configuration
56%
8
被引用数 (Scopus)
1994
Contractile triples in 3-connected graphs
McCuaig, W.
&
Ota, K.
,
1994 3月
,
In:
Journal of Combinatorial Theory, Series B.
60
,
2
,
p. 308-314
7 p.
研究成果
:
Article
›
査読
Adjacent
100%
Connected graph
97%
Vertex of a graph
68%
Graph in graph theory
55%
19
被引用数 (Scopus)
1993
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
›
査読
Contractible Edge
100%
Long Cycle
84%
Exception
32%
Graph in graph theory
30%
Family
15%
12
被引用数 (Scopus)
1991
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
›
査読
Minimum Degree
100%
Induced Subgraph
97%
Graph in graph theory
88%
32
被引用数 (Scopus)
1989
Longest cycles in 3‐connected graphs contain three contractible edges
Dean, N.
,
Hemminger, R. L.
&
Ota, K.
,
1989
,
In:
Journal of Graph Theory.
13
,
1
,
p. 17-21
5 p.
研究成果
:
Article
›
査読
Contractible Edge
100%
Long Cycle
84%
Longest Path
42%
Graph in graph theory
30%
Corollary
25%
18
被引用数 (Scopus)
1988
A sufficient condition for a bipartite graph to have a k‐factor
Enomoto, H.
,
Ota, K.
&
Kano, M.
,
1988
,
In:
Journal of Graph Theory.
12
,
1
,
p. 141-151
11 p.
研究成果
:
Article
›
査読
Bipartite Graph
100%
Sufficient Conditions
53%
Theorem
43%
Generalization
18%
5
被引用数 (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
›
査読
Contractible Edge
100%
Connected graph
52%
Extremal Graphs
37%
Contraction
13%
Lower bound
10%
10
被引用数 (Scopus)
‹ 前
1
2