太田 克弘

研究成果

年別の研究成果 1988 1995 1996 1997 2001 2002 2011 2012 2021

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

年別の研究成果

年別の研究成果

検索結果

• 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)
• 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)
• 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)
• 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)
• 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)
• 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)
• 1996

  A Degree Condition for the Existence of Regular Factors in K₁, _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)
• 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)
• 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)
• 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)
• 2000

  On Minimally (n, λ)-Connected Graphs

  Kaneko, A. & Ota, K., 2000 9月, In: Journal of Combinatorial Theory. Series B. 80, 1, p. 156-171 16 p.

  研究成果: Article › 査読

  • Connected graph 100%
  • Subset 23%
  • Subgraph 22%
  • Vertex Connectivity 18%
  • Edge-connectivity 16%
  9 被引用数 (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 › 査読

  • Pi 100%
  • Partition 71%
  • Path 66%
  • Degree Sum 63%
  • Disjoint Paths 57%
  10 被引用数 (Scopus)
• 2001

  Chromatic numbers of quadrangulations on closed surfaces

  Archdeacon, D., Hutchinson, J., Nakamoto, A., Negam, S. & Ota, K., 2001 6月, In: Journal of Graph Theory. 37, 2, p. 100-114 15 p.

  研究成果: Article › 査読

  • Quadrangulation 100%
  • Chromatic number 69%
  • Klein bottle 47%
  • Closed 41%
  • Torus 19%
  30 被引用数 (Scopus)

• Fractional chromatic numbers of cones over graphs

  Archdeacon, D., Hutchinson, J., Nakamoto, A., Negam, S. & Ota, K., 2001 10月, In: Journal of Graph Theory. 38, 2, p. 87-94 8 p.

  研究成果: Article › 査読

  • Fractional Chromatic number 100%
  • Cone 52%
  • Graph in graph theory 30%
  • Generalise 11%
  • Generalization 11%
  30 被引用数 (Scopus)

• Hamiltonian cycles in n-factor-critical graphs

  Kawarabayashi, K. I., Ota, K. & Saito, A., 2001 9月 28, In: Discrete Mathematics. 240, 1-3, p. 71-82 12 p.

  研究成果: Article › 査読

  • Factor Graph 100%
  • Critical Graph 85%
  • Hamiltonian circuit 78%
  • Exception 46%
  • Graph in graph theory 32%
  4 被引用数 (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 › 査読

  • Degree Condition 100%
  • Paul Adrien Maurice Dirac 75%
  • Bipartite Graph 70%
  • Disjoint 60%
  • Cycle 53%
  5 被引用数 (Scopus)

• Vertex-Disjoint Paths in Graphs

  Egawa, Y. & Ota, K., 2001 12月 1, In: Ars Combinatoria. 61, p. 23-31 9 p.

  研究成果: Article › 査読

  • Disjoint Paths 100%
  • Vertex of a graph 48%
  • Minimum Degree 43%
  • Graph in graph theory 38%
  • Degree Sum 27%
  2 被引用数 (Scopus)
• 2002

  Chromatic Numbers and Cycle Parities of Quadrangulations on Nonorientable Closed Surfaces

  Nakamoto, A., Negami, S. & Ota, K., 2002 7月, In: Electronic Notes in Discrete Mathematics. 11, p. 509-518 10 p.

  研究成果: Article › 査読

  • Quadrangulation 100%
  • Parity 72%
  • Chromatic number 69%
  • Cycle 50%
  • Closed 41%

• On 3-coloring of plane triangulations

  Nakamoto, A., Ota, K. & Watanabe, M., 2002 7月 1, In: Electronic Notes in Discrete Mathematics. 11, p. 519-524 6 p.

  研究成果: Article › 査読

  • Coloring 100%
  • Vertex Coloring 99%
  • Triangulation 94%
  • Divides 81%
  • Colouring 72%

• On a hamiltonian cycle in which specified vertices are not isolated

  Kaneko, A., Kawarabayashi, K. I., Ota, K. & Yoshimoto, K., 2002 12月 6, In: Discrete Mathematics. 258, 1-3, p. X85-91

  研究成果: Article › 査読

  Open Access

  • Hamiltonian circuit 100%
  • Vertex of a graph 51%
  • Vertex Degree 49%
  • Minimum Degree 46%
  • Adjacent 37%
  1 被引用数 (Scopus)

• On minimally 3-connected graphs on a surface

  Ota, K., 2002 7月, In: Electronic Notes in Discrete Mathematics. 11, p. 760 1 p.

  研究成果: Article › 査読

  • Connected graph 100%
  • Closed 72%
  • Euler Characteristic 67%

• 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

  • Self-complementary Graph 100%
  1 被引用数 (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 › 査読

  • Hamilton Cycle 100%
  • Graph in graph theory 36%
  • Undirected Graph 25%
  • Complete Graph 24%
  • Adjacent 21%
  1 被引用数 (Scopus)
• 2003

  2-connected 7-coverings of 3-connected graphs on surfaces

  Kawarabayashi, K. I., Nakamoto, A. & Ota, K., 2003 5月, In: Journal of Graph Theory. 43, 1, p. 26-36 11 p.

  研究成果: Article › 査読

  • Graphs on Surfaces 100%
  • Covering 55%
  • Connected graph 54%
  • Euler 38%
  • Genus 36%
  6 被引用数 (Scopus)

• Diagonal Flips in Hamiltonian Triangulations on the Sphere

  Mori, R., Nakamoto, A. & Ota, K., 2003 11月 10, In: Graphs and Combinatorics. 19, 3, p. 413-418 6 p.

  研究成果: Article › 査読

  • Flip 100%
  • Triangulation 83%
  • Hamilton Cycle 55%
  • Transform 32%
  24 被引用数 (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 › 査読

  • Graphs on Surfaces 100%
  • Subgraph 55%
  • Covering 55%
  • Connected graph 54%
  • Klein bottle 44%
  15 被引用数 (Scopus)
• 2004

  Chromatic numbers and cycle parities of quadrangulations on nonorientable closed surfaces

  Nakamoto, A., Negami, S. & Ota, K., 2004 8月 6, In: Discrete Mathematics. 285, 1-3, p. 211-218 8 p.

  研究成果: Article › 査読

  • Quadrangulation 100%
  • Parity 72%
  • Chromatic number 69%
  • Cycle 50%
  • Closed 41%
  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 › 査読

  • Triangulation 100%
  • Quadrangulation 48%
  • Closed 40%
  6 被引用数 (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 › 査読

  • Degree Condition 100%
  • Minimum Degree 79%
  • Bipartite Graph 70%
  • Disjoint 60%
  • Cycle 53%
  4 被引用数 (Scopus)
• 2005

  A σ_k type condition for heavy cycles in weighted graphs

  Enomoto, H., Fujisawa, J. & Ota, K., 2005 7月 1, In: Ars Combinatoria. 76, p. 225-232 8 p.

  研究成果: Article › 査読

  • Weighted Graph 100%
  • Cycle 66%
  • Degree Sum 17%
  • Hamilton Cycle 17%
  • Vertex of a graph 15%
  4 被引用数 (Scopus)

• On 3-coloring of plane triangulations

  Nakamoto, A., Ota, K. & Watanabe, M., 2005 4月, In: Ars Combinatoria. 75, p. 157-162 6 p.

  研究成果: Article › 査読

  • Triangulation 100%
  • Colouring 89%
  • Vertex Coloring 41%
  • Infinite series 36%
  • Color 28%

• 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 › 査読

  • Degree Condition 100%
  • Weighted Graph 80%
  • Path 52%
  • Hamilton Path 22%
  • Join 14%
  1 被引用数 (Scopus)
• 2006

  A pair of forbidden subgraphs and perfect matchings

  Fujita, S., Kawarabayashi, K. I., Leonardo Lucchesi, C., Ota, K., Plummer, M. D. & Saito, A., 2006 5月, In: Journal of Combinatorial Theory. Series B. 96, 3, p. 315-324 10 p.

  研究成果: Article › 査読

  • Forbidden Subgraph 100%
  • Perfect Matching 80%
  • Graph in graph theory 34%
  • Odd 15%
  • Triangle-free 14%
  27 被引用数 (Scopus)

• Weighted Ramsey problem

  Fujisawa, J. & Ota, K., 2006 12月 1, In: Australasian Journal of Combinatorics. 34, p. 331-342 12 p.

  研究成果: Article › 査読

  • Weighted Graph 100%
  • Subgraph 78%
  • Edge-colored Graph 60%
  • Complete Graph 43%
  • Non-negative 32%
  1 被引用数 (Scopus)
• 2007

  Independence number and vertex-disjoint cycles

  Egawa, Y., Enomoto, H., Jendrol, S., Ota, K. & Schiermeyer, I., 2007 5月 28, In: Discrete Mathematics. 307, 11-12, p. 1493-1498 6 p.

  研究成果: Article › 査読

  • Independence number 100%
  • Disjoint 68%
  • Cycle 60%
  • Vertex of a graph 49%
  • Graph in graph theory 26%
  8 被引用数 (Scopus)