default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKatsuhiro Ota
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j83]Katsuhiro Ota, Masahiro Sanka
:
Some conditions for hamiltonian cycles in 1-tough (K2 ∪ kK1)-free graphs. Discret. Math. 347(3): 113841 (2024)- 2023
- [j82]Shuya Chiba, Katsuhiro Ota, Tomoki Yamashita:
Minimum degree conditions for the existence of a sequence of cycles whose lengths differ by one or two. J. Graph Theory 103(2): 340-358 (2023) - 2022
- [j81]Naoki Matsumoto, Ryusei Moriyama, Katsuhiro Ota:
Graph grabbing game on totally-weighted graphs. Discret. Appl. Math. 322: 384-390 (2022) - [j80]Katsuhiro Ota, Masahiro Sanka:
Hamiltonian cycles in 2-tough 2 K 2 $2{K}_{2}$ -free graphs. J. Graph Theory 101(4): 769-781 (2022) - 2021
- [j79]Jack H. Koolen, Akihiro Munemasa, Atsuhiro Nakamoto, Katsuhiro Ota, Akira Saito:
Preface to the special issue dedicated to Professors Eiichi Bannai and Hikoe Enomoto on their 75th birthdays. Graphs Comb. 37(5): 1465-1466 (2021) - 2020
- [j78]Mikio Kano, Shun-ichi Maezawa, Katsuhiro Ota, Masao Tsugaki, Takamasa Yashima:
Color degree sum conditions for properly colored spanning trees in edge-colored graphs. Discret. Math. 343(11): 112042 (2020)
2010 – 2019
- 2015
- [j77]Atsuhiro Nakamoto, Katsuhiro Ota, Akira Saito:
Preface. Graphs Comb. 31(6): 1819-1820 (2015) - [j76]Guantao Chen, Katsuhiro Ota:
Hadwiger's conjecture for degree sequences. J. Comb. Theory B 114: 247-249 (2015) - [j75]Jun Fujisawa, Katsuhiro Ota:
Edge Proximity Conditions for Extendability in Planar Triangulations. J. Graph Theory 80(1): 1-11 (2015) - [j74]Guantao Chen, Ronald J. Gould, Kazuhide Hirohata, Katsuhiro Ota, Songling Shan:
Disjoint Chorded Cycles of the Same Length. SIAM J. Discret. Math. 29(2): 1030-1041 (2015) - 2013
- [j73]Katsuhiro Ota, Kenta Ozeki, Gabriel Sueiro:
Forbidden induced subgraphs for near perfect matchings. Discret. Math. 313(11): 1267-1280 (2013) - [j72]Katsuhiro Ota, Gabriel Sueiro:
Forbidden Induced Subgraphs for Perfect Matchings. Graphs Comb. 29(2): 289-299 (2013) - [j71]Katsuhiro Ota, Gabriel Sueiro:
Forbidden Induced Subgraphs for Toughness. J. Graph Theory 73(2): 191-202 (2013) - 2012
- [j70]Guantao Chen, Katsuhiro Ota, Akira Saito, Yi Zhao:
Hamiltonian cycles with all small even chords. Discret. Math. 312(6): 1226-1240 (2012) - [j69]Katsuhiro Ota, Kenta Ozeki:
Spanning trees in 3-connected K3, t-minor-free graphs. J. Comb. Theory B 102(5): 1179-1188 (2012) - [j68]Jun Fujisawa, Katsuhiro Ota:
Maximal K3's and Hamiltonicity of 4-connected claw-free graphs. J. Graph Theory 70(1): 40-53 (2012) - [j67]Atsuhiro Nakamoto, Katsuhiro Ota, Kenta Ozeki:
Book Embedding of Toroidal Bipartite Graphs. SIAM J. Discret. Math. 26(2): 661-669 (2012) - 2011
- [j66]Hikoe Enomoto, Yukichika Ohnishi, Katsuhiro Ota:
Spanning Trees with Bounded Total Excess. Ars Comb. 102: 289-295 (2011) - [j65]Guantao Chen, Yoshimi Egawa, Ken-ichi Kawarabayashi, Bojan Mohar, Katsuhiro Ota:
Toughness of Ka,t-Minor-Free Graphs. Electron. J. Comb. 18(1) (2011) - [j64]Yusuke Higuchi, Atsuhiro Nakamoto, Katsuhiro Ota, Tadashi Sakuma:
N-flips in even triangulations on the torus and Dehn twists preserving monodromies. Discret. Math. 311(13): 1128-1135 (2011) - [j63]Jun Fujisawa, Katsuhiro Ota, Kenta Ozeki, Gabriel Sueiro:
Forbidden induced subgraphs for star-free graphs. Discret. Math. 311(21): 2475-2484 (2011) - [j62]Katsuhiro Ota, Michael D. Plummer, Akira Saito:
Forbidden triples for perfect matchings. J. Graph Theory 67(3): 250-259 (2011) - [j61]Robert E. L. Aldred, Yoshimi Egawa, Jun Fujisawa, Katsuhiro Ota, Akira Saito:
The existence of a 2-factor in K1, n-free graphs with large connectivity and large edge-connectivity. J. Graph Theory 68(1): 77-89 (2011) - 2010
- [j60]Katsuhiro Ota, Takeshi Sugiyama:
Forbidden subgraphs and the existence of spanning k-trees. Discret. Math. 310(24): 3506-3511 (2010)
2000 – 2009
- 2009
- [j59]Atsuhiro Nakamoto, Yoshiaki Oda, Katsuhiro Ota:
3-trees with few vertices of degree 3 in circuit graphs. Discret. Math. 309(4): 666-672 (2009) - [j58]Katsuhiro Ota, Kenta Ozeki:
Spanning trees in 3-connected K3, t-minor-free graphs. Electron. Notes Discret. Math. 34: 145-149 (2009) - 2008
- [j57]Yoshimi Egawa, Shinya Fujita, Katsuhiro Ota:
K1, 3-factors in graphs. Discret. Math. 308(24): 5965-5973 (2008) - [j56]Jun Fujisawa, Katsuhiro Ota, Takeshi Sugiyama, Masao Tsugaki:
Forbidden subgraphs and the existence of paths and cycles passing through specified vertices. Discret. Math. 308(24): 6111-6114 (2008) - 2007
- [j55]Yoshimi Egawa, Hikoe Enomoto, Stanislav Jendrol', Katsuhiro Ota, Ingo Schiermeyer:
Independence number and vertex-disjoint cycles. Discret. Math. 307(11-12): 1493-1498 (2007) - [j54]Guantao Chen, Ronald J. Gould, Ken-ichi Kawarabayashi, Katsuhiro Ota, Akira Saito, Ingo Schiermeyer:
Chvátal Erdós condition and 2-factors with a specyfied number of components. Discuss. Math. Graph Theory 27(3): 401-407 (2007) - 2006
- [j53]Jun Fujisawa, Katsuhiro Ota:
Weighted Ramsey problem. Australas. J Comb. 34: 331-342 (2006) - [j52]Shinya Fujita, Ken-ichi Kawarabayashi, Cláudio Leonardo Lucchesi, Katsuhiro Ota, Michael D. Plummer, Akira Saito:
A pair of forbidden subgraphs and perfect matchings. J. Comb. Theory B 96(3): 315-324 (2006) - 2005
- [j51]Atsuhiro Nakamoto, Katsuhiro Ota, Mamoru Watanabe:
On 3-coloring of plane triangulations. Ars Comb. 75 (2005) - [j50]Hikoe Enomoto, Jun Fujisawa, Katsuhiro Ota:
A sk type condition for heavy cycles in weighted graphs. Ars Comb. 76 (2005) - [j49]Hikoe Enomoto, Jun Fujisawa, Katsuhiro Ota:
Ore-type degree condition for heavy paths in weighted graphs. Discret. Math. 300(1-3): 100-109 (2005) - 2004
- [j48]Atsuhiro Nakamoto, Seiya Negami, Katsuhiro Ota:
Chromatic numbers and cycle parities of quadrangulations on nonorientable closed surfaces. Discret. Math. 285(1-3): 211-218 (2004) - [j47]Atsuhiro Nakamoto, Seiya Negami, Katsuhiro Ota, Jozef Sirán:
Planar triangulations which quadrangulate other surfaces. Eur. J. Comb. 25(6): 817-833 (2004) - [j46]Guantao Chen, Hikoe Enomoto, Ken-ichi Kawarabayashi, Katsuhiro Ota, Dingjun Lou, Akira Saito:
Vertex-disjoint cycles containing specified vertices in a bipartite graph. J. Graph Theory 46(3): 145-166 (2004) - 2003
- [j45]Ryuichi Mori, Atsuhiro Nakamoto, Katsuhiro Ota:
Diagonal Flips in Hamiltonian Triangulations on the Sphere. Graphs Comb. 19(3): 413-418 (2003) - [j44]Ken-ichi Kawarabayashi, Atsuhiro Nakamoto, Katsuhiro Ota:
Subgraphs of graphs on surfaces with high representativity . J. Comb. Theory B 89(2): 207-229 (2003) - [j43]Ken-ichi Kawarabayashi, Atsuhiro Nakamoto, Katsuhiro Ota:
2-connected 7-coverings of 3-connected graphs on surfaces. J. Graph Theory 43(1): 26-36 (2003) - 2002
- [j42]Hikoe Enomoto, Kyoji Ohba, Katsuhiro Ota, Junko Sakamoto:
Choice number of some complete multi-partite graphs. Discret. Math. 244(1-3): 55-66 (2002) - [j41]Ken-ichi Kawarabayashi, Atsuhiro Nakamoto, Yoshiaki Oda, Katsuhiro Ota, Shinsei Tazawa, Mamoru Watanabe:
On separable self-complementary graphs. Discret. Math. 257(1): 165-168 (2002) - [j40]Atsushi Kaneko, Ken-ichi Kawarabayashi, Katsuhiro Ota, Kiyoshi Yoshimoto:
On a hamiltonian cycle in which specified vertices are not isolated. Discret. Math. 258(1-3): 85-91 (2002) - [j39]Atsuhiro Nakamoto, Seiya Negami, Katsuhiro Ota:
Chromatic Numbers and Cycle Parities of Quadrangulations on Nonorientable Closed Surfaces. Electron. Notes Discret. Math. 11: 509-518 (2002) - [j38]Atsuhiro Nakamoto, Katsuhiro Ota, Mamoru Watanabe:
On 3-coloring of plane triangulations. Electron. Notes Discret. Math. 11: 519-524 (2002) - [j37]Katsuhiro Ota:
On minimally 3-connected graphs on a surface. Electron. Notes Discret. Math. 11: 760 (2002) - [j36]Mariko Hagita, Yoshiaki Oda, Katsuhiro Ota:
The Diameters of Some Transition Graphs Constructed from Hamilton Cycles. Graphs Comb. 18(1): 105-117 (2002) - [j35]Ken-ichi Kawarabayashi, Haruhide Matsuda, Yoshiaki Oda, Katsuhiro Ota:
Path factors in cubic graphs. J. Graph Theory 39(3): 188-193 (2002) - [j34]Ken-ichi Kawarabayashi, Katsuhiro Ota, Akira Saito:
Hamiltonian cycles in n-extendable graphs. J. Graph Theory 40(2): 75-82 (2002) - 2001
- [j33]Guantao Chen, Hikoe Enomoto, Ken-ichi Kawarabayashi, Katsuhiro Ota, Dingjun Lou, Akira Saito:
Vertex-disjoint cycles containing specified edges in a bipartite graph. Australas. J Comb. 23: 37-48 (2001) - [j32]Yoshimi Egawa, Katsuhiro Ota:
Vertex-Disjoint Paths in Graphs. Ars Comb. 61 (2001) - [j31]Ken-ichi Kawarabayashi, Katsuhiro Ota, Akira Saito:
Hamiltonian cycles in n-factor-critical graphs. Discret. Math. 240(1-3): 71-82 (2001) - [j30]Katsuhiro Ota:
Vertex-Disjoint Stars in Graphs. Discuss. Math. Graph Theory 21(2): 179-185 (2001) - [j29]Dan Archdeacon, Joan P. Hutchinson, Atsuhiro Nakamoto, Seiya Negami, Katsuhiro Ota:
Chromatic numbers of quadrangulations on closed surfaces. J. Graph Theory 37(2): 100-114 (2001) - 2000
- [j28]Hikoe Enomoto, Shinsuke Matsunaga, Katsuhiro Ota:
Graph decompositions and D3-paths with a prescribed endvertex. Discret. Math. 213(1-3): 87-104 (2000) - [j27]Atsushi Kaneko, Katsuhiro Ota:
On Minimally (n, )-Connected Graphs. J. Comb. Theory B 80(1): 156-171 (2000) - [j26]Hikoe Enomoto, Katsuhiro Ota:
Partitions of a graph into paths with prescribed endvertices and lengths. J. Graph Theory 34(2): 163-169 (2000)
1990 – 1999
- 1999
- [j25]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. Discret. Appl. Math. 92(2-3): 149-155 (1999) - [j24]Yoshimi Egawa, Katsuhiro Ota:
Vertex-disjoint claws in graphs. Discret. Math. 197-198: 225-246 (1999) - [j23]Hikoe Enomoto, Katsuhiro Ota:
Connected subgraphs with small degree sums in 3-connected planar graphs. J. Graph Theory 30(3): 191-203 (1999) - 1998
- [j22]Peter Frankl, Katsuhiro Ota, Norihide Tokushige:
Uniform Intersecting Families with Covering Number Restrictions. Comb. Probab. Comput. 7(1): 47-56 (1998) - [j21]Hikoe Enomoto, Yoshiaki Oda, Katsuhiro Ota:
Pyramidal Tours with Step-backs and the Asymmetric Traveling Salesman Problem. Discret. Appl. Math. 87(1-3): 57-65 (1998) - 1997
- [j20]Atsuhiro Nakamoto, Katsuhiro Ota:
Diagonal Transformations in Quadrangulations and Dehn Twists Preserving Cycle Parities. J. Comb. Theory B 69(2): 125-141 (1997) - [j19]Atsuhiro Nakamoto, Katsuhiro Ota:
Diagonal Transformations of Graphs and Dehn Twists of Surfaces. J. Comb. Theory B 70(2): 292-300 (1997) - [j18]Hikoe Enomoto, Tomoki Nakamigawa, Katsuhiro Ota:
On the Pagenumber of Complete Bipartite Graphs. J. Comb. Theory B 71(1): 111-120 (1997) - [j17]Hiroshi Maehara, Katsuhiro Ota, Norihide Tokushige:
Every Graph Is an Integral Distance Graph in the Plane. J. Comb. Theory A 80(2): 290-294 (1997) - [j16]Hikoe Enomoto, Kazuhide Hirohata, Katsuhiro Ota:
Long cycles passing through a specified edge in a 3-connected graph. J. Graph Theory 24(3): 275-279 (1997) - 1996
- [j15]Seiya Negami, Katsuhiro Ota:
Polynomial invariants of graphs II. Graphs Comb. 12(1): 189-198 (1996) - [j14]Hikoe Enomoto, Tadashi Iida, Katsuhiro Ota:
Connected Spanning Subgraphs of 3-Connected Planar Graphs. J. Comb. Theory, Ser. B 68(2): 314-323 (1996) - [j13]Peter Frankl, Katsuhiro Ota, Norihide Tokushige:
Covers in Uniform Intersecting Families and a Counterexample to a Conjecture of Lovász. J. Comb. Theory A 74(1): 33-42 (1996) - [j12]Peter Frankl, Katsuhiro Ota, Norihide Tokushige:
Exponents of Uniform L-Systems. J. Comb. Theory A 75(1): 23-43 (1996) - [j11]Katsuhiro Ota, Taro Tokuda:
A degree condition for the existence of regular factors in K1, n-free graphs. J. Graph Theory 22(1): 59-64 (1996) - 1995
- [j10]Yoshimi Egawa, Katsuhiro Ota, Akira Saito, Xingxing Yu:
Non-Contractible Edges in A 3-Connected Graph. Comb. 15(3): 357-364 (1995) - [j9]Katsuhiro Ota:
Cycles through prescribed vertices with large degree sum. Discret. Math. 145(1-3): 201-210 (1995) - [j8]Peter Frankl, Katsuhiro Ota, Norihide Tokushige:
Uniform Intersecting Families with Covering Number Four. J. Comb. Theory A 71(1): 127-145 (1995) - [j7]Atsuhiro Nakamoto, Katsuhiro Ota:
Note on irreducible triangulations of surfaces. J. Graph Theory 20(2): 227-233 (1995) - 1994
- [j6]William McCuaig, Katsuhiro Ota:
Contractile Triples in 3-Connected Graphs. J. Comb. Theory B 60(2): 308-314 (1994) - 1993
- [j5]Robert E. L. Aldred, Robert L. Hemminger, Katsuhiro Ota:
The 3-connected graphs having a longest cycle containing only three contractible edges. J. Graph Theory 17(3): 361-371 (1993) - 1991
- [j4]Yoshimi Egawa, Katsuhiro Ota:
Regular factors in K1, n free graphs. J. Graph Theory 15(3): 337-344 (1991) - [c1]Nathaniel Dean, Katsuhiro Ota:
2-factors, connectivity, and graph minors. Graph Structure Theory 1991: 381-386
1980 – 1989
- 1989
- [j3]Nathaniel Dean, Robert L. Hemminger, Katsuhiro Ota:
Longest cycles in 3-connected graphs contain three contractible edges. J. Graph Theory 13(1): 17-21 (1989) - 1988
- [j2]Katsuhiro Ota:
The number of contractible edges in 3-connected graphs. Graphs Comb. 4(1): 333-354 (1988) - [j1]Hikoe Enomoto, Katsuhiro Ota, Mikio Kano:
A sufficient condition for a bipartite graph to have a k-factor. J. Graph Theory 12(1): 141-151 (1988)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
