K. Ota

发表

A sufficient condition for a bipartite graph to have a k-factor

Hikoe Enomoto, Katsuhiro Ota, Mikio Kano, 1988, J. Graph Theory.

THREE-CYCLE REVERSIONS IN ORIENTED PLANAR TRIANGULATIONS

K. Ota, Atsuhiro Nakamoto, T. Tanuma, 1997 .

Chvátal Erdós condition and 2-factors with a specyfied number of components

Ken-ichi Kawarabayashi, Akira Saito, Katsuhiro Ota, 2007, Discuss. Math. Graph Theory.

Hamiltonian cycles in n‐extendable graphs

Ken-ichi Kawarabayashi, Akira Saito, Katsuhiro Ota, 2002, J. Graph Theory.

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

Ken-ichi Kawarabayashi, Atsuhiro Nakamoto, Katsuhiro Ota, 2003, J. Graph Theory.

Path factors in cubic graphs

Ken-ichi Kawarabayashi, Katsuhiro Ota, Haruhide Matsuda, 2002, J. Graph Theory.

Graph grabbing game on totally-weighted graphs

K. Ota, N. Matsumoto, Ryusei Moriyama, 2022, Discrete Applied Mathematics.

Partitions of a graph into paths with prescribed endvertices and lengths

H. Enomoto, K. Ota, 2000, J. Graph Theory.

Hamiltonian cycles in 1-tough $(K_2 \cup kK_1)$-free graphs

K. Ota, Masahiro Sanka, 2022, 2210.10408.

Hamiltonian cycles in 2‐tough 2K2 $2{K}_{2}$ ‐free graphs

K. Ota, Masahiro Sanka, 2022, Journal of Graph Theory.

THE CHVÁTAL-ERDŐS CONDITION AND 2-FACTORS WITH A SPECIFIED NUMBER OF COMPONENTS

K. Ota, K. Kawarabayashi, R. Gould, 2007 .

Connected subgraphs with small degree sums in 3-connected planar graphs

H. Enomoto, K. Ota, 1999, J. Graph Theory.

Polynomial invariants of graphs II

Seiya Negami, Katsuhiro Ota, K. Ota, 1996, Graphs Comb..

Hamiltonian cycles with all small even chords

Yi Zhao, Akira Saito, Katsuhiro Ota, 2012, Discret. Math..

Color degree sum conditions for properly colored spanning trees in edge-colored graphs

Mikio Kano, Katsuhiro Ota, Masao Tsugaki, 2020, Discret. Math..

Vertex‐disjoint cycles containing specified vertices in a bipartite graph

Ken-ichi Kawarabayashi, Dingjun Lou, Hikoe Enomoto, 2004, J. Graph Theory.

Cycles through prescribed vertices with large degree sum

Katsuhiro Ota, K. Ota, 1995, Discret. Math..

Toughness, 2-factors and Hamiltonian cycles in 2K2-free graphs

K. Ota, Masahiro Sanka, 2021 .

Algorithmic Aspects of Pyramidal Tours with Restricted Jump-Backs

Katsuhiro Ota, K. Ota, Yoshiaki Oda, 2001 .

Pyramidal Tours with Step-backs and the Asymmetric Traveling Salesman Problem

Hikoe Enomoto, Katsuhiro Ota, Yoshiaki Oda, 1998, Discret. Appl. Math..

Chromatic numbers of quadrangulations on closed surfaces

Seiya Negami, Atsuhiro Nakamoto, Dan Archdeacon, 2001, J. Graph Theory.

Lower Bounds for the Number of Edge-crossings Over the Spine in a Topological Book Embedding of a Graph

Hikoe Enomoto, Katsuhiro Ota, Miki Shimabara Miyauchi, 1999, Discret. Appl. Math..

On the Pagenumber of Complete Bipartite Graphs

Hikoe Enomoto, Katsuhiro Ota, Tomoki Nakamigawa, 1997, J. Comb. Theory, Ser. B.

Fractional chromatic numbers of cones over graphs

Atsuhiro Nakamoto, Katsuhiro Ota, Dan Archdeacon, 2001 .

Chromatic Numbers and Cycle Parities of Quadrangulations on Nonorientable Closed Surfaces

Seiya Negami, Atsuhiro Nakamoto, Katsuhiro Ota, 2002, Electron. Notes Discret. Math..

Note on irreducible triangulations of surfaces

Atsuhiro Nakamoto, Katsuhiro Ota, K. Ota, 1995, J. Graph Theory.

Planar triangulations which quadrangulate other surfaces

Seiya Negami, Atsuhiro Nakamoto, Katsuhiro Ota, 2004, Eur. J. Comb..

Diagonal Transformations of Graphs and Dehn Twists of Surfaces

Atsuhiro Nakamoto, Katsuhiro Ota, K. Ota, 1997, J. Comb. Theory, Ser. B.

Diagonal Transformations in Quadrangulations and Dehn Twists Preserving Cycle Parities

Atsuhiro Nakamoto, Katsuhiro Ota, K. Ota, 1997, J. Comb. Theory, Ser. B.

Disjoint Chorded Cycles of the Same Length

Katsuhiro Ota, Ronald J. Gould, Kazuhide Hirohata, 2015, SIAM J. Discret. Math..

Contractile Triples in 3-Connected Graphs

Katsuhiro Ota, William McCuaig, K. Ota, 1994, J. Comb. Theory, Ser. B.

Maximal K3's and Hamiltonicity of 4‐connected claw‐free graphs

Jun Fujisawa, Katsuhiro Ota, K. Ota, 2012, J. Graph Theory.

Maximal K 3 ’ s and Hamiltonicity of 4-connected Claw-free Graphs

K. Ota, J. Fujisawa, 2010 .

Spanning trees in 3-connected K3, t-minor-free graphs

Katsuhiro Ota, Kenta Ozeki, K. Ota, 2009, Electron. Notes Discret. Math..

On minimally 3-connected graphs on a surface

Katsuhiro Ota, K. Ota, 2002, Electron. Notes Discret. Math..

The 3-connected graphs having a longest cycle containing only three contractible edges

Robert L. Hemminger, Katsuhiro Ota, Robert E. L. Aldred, 1993, J. Graph Theory.

Longest cycles in 3-connected graphs contain three contractible edges

Robert L. Hemminger, Katsuhiro Ota, Nathaniel Dean, 1989, J. Graph Theory.