Katsuhiro Ota

From MaRDI portal
Person:214980

Available identifiers

zbMath Open ota.katsuhiroMaRDI QIDQ214980

List of research outcomes

PublicationDate of PublicationType
Some conditions for Hamiltonian cycles in 1-tough \((K_2 \cup kK_1)\)-free graphs2024-01-17Paper
Minimum degree conditions for the existence of a sequence of cycles whose lengths differ by one or two2023-10-12Paper
Hamiltonian cycles in 2‐tough 2K2 $2{K}_{2}$‐free graphs2023-10-05Paper
Graph grabbing game on totally-weighted graphs2022-10-13Paper
Color degree sum conditions for properly colored spanning trees in edge-colored graphs2020-09-10Paper
Edge Proximity Conditions for Extendability in Planar Triangulations2015-09-29Paper
https://portal.mardi4nfdi.de/entity/Q55003722015-08-05Paper
Hadwiger's conjecture for degree sequences2015-06-22Paper
Disjoint Chorded Cycles of the Same Length2015-06-18Paper
Forbidden induced subgraphs for near perfect matchings2013-12-02Paper
Spanning trees in 3-connected K3,t-minor-free graphs2013-10-10Paper
Forbidden Induced Subgraphs for Toughness2013-05-21Paper
Forbidden induced subgraphs for perfect matchings2013-05-13Paper
https://portal.mardi4nfdi.de/entity/Q46499872012-11-15Paper
Spanning trees in 3-connected \(K_{3,t}\)-minor-free graphs2012-10-19Paper
Book Embedding of Toroidal Bipartite Graphs2012-09-12Paper
Maximal K3's and Hamiltonicity of 4-connected claw-free graphs2012-06-04Paper
Forbidden induced subgraphs for star-free graphs2012-04-13Paper
Hamiltonian cycles with all small even chords2012-04-13Paper
A note on total excess of spanning trees2011-12-01Paper
The existence of a 2-factor in K1, n-free graphs with large connectivity and large edge-connectivity2011-10-12Paper
Toughness of \(K_{a,t}\)-minor-free graphs2011-07-29Paper
Forbidden triples for perfect matchings2011-07-21Paper
\(N\)-flips in even triangulations on the torus and Dehn twists preserving monodromies2011-05-31Paper
Forbidden subgraphs and the existence of spanning \(k\)-trees2010-11-19Paper
Path factors in cubic graphs2009-12-08Paper
On \(2\)-factors in \(r\)-connected \(\{K_{1,k},P_4\}\)-free graphs2009-04-21Paper
3-trees with few vertices of degree 3 in circuit graphs2009-04-09Paper
\(K_{1,3}\)-factors in graphs2009-01-28Paper
Forbidden subgraphs and the existence of paths and cycles passing through specified vertices2009-01-28Paper
Chvátal Erdős condition and 2-factors with a specyfied number of components2008-06-18Paper
https://portal.mardi4nfdi.de/entity/Q54432162008-02-20Paper
Independence number and vertex-disjoint cycles2007-04-26Paper
https://portal.mardi4nfdi.de/entity/Q34339082007-04-23Paper
https://portal.mardi4nfdi.de/entity/Q54925862006-10-16Paper
https://portal.mardi4nfdi.de/entity/Q54879272006-09-13Paper
A pair of forbidden subgraphs and perfect matchings.2006-05-18Paper
https://portal.mardi4nfdi.de/entity/Q57086032005-11-18Paper
https://portal.mardi4nfdi.de/entity/Q57086042005-11-18Paper
https://portal.mardi4nfdi.de/entity/Q57086262005-11-18Paper
Ore-type degree condition for heavy paths in weighted graphs2005-10-26Paper
https://portal.mardi4nfdi.de/entity/Q54635762005-08-04Paper
https://portal.mardi4nfdi.de/entity/Q54614502005-07-26Paper
On minimally 3-connected graphs on a surface2005-04-15Paper
Planar triangulations which quadrangulate other surfaces2004-10-04Paper
Chromatic numbers and cycle parities of quadrangulations on nonorientable closed surfaces2004-08-19Paper
Vertex-disjoint cycles containing specified vertices in a bipartite graph2004-08-04Paper
Subgraphs of graphs on surfaces with high representativity2004-01-06Paper
Diagonal flips in Hamiltonian triangulations on the sphere2003-10-16Paper
2-connected 7-coverings of 3-connected graphs on surfaces2003-05-22Paper
Vertex-Disjoint Stars in Graphs2003-01-07Paper
On minimally \((n,\lambda)\)-connected graphs2002-12-10Paper
On separable self-complementary graphs2002-12-02Paper
On a Hamiltonian cycle in which specified vertices are not isolated2002-12-02Paper
Hamiltonian cycles in n‐extendable graphs2002-07-11Paper
Choice number of some complete multi-partite graphs2002-05-21Paper
The diameters of some transition graphs constructed from Hamilton cycles2002-05-14Paper
Hamiltonian cycles in \(n\)-factor-critical graphs2002-04-16Paper
https://portal.mardi4nfdi.de/entity/Q27125082002-01-21Paper
Chromatic numbers of quadrangulations on closed surfaces2001-12-16Paper
Algorithmic Aspects of Pyramidal Tours with Restricted Jump-Backs2001-01-01Paper
Partitions of a graph into paths with prescribed endvertices and lengths2000-09-20Paper
Graph decompositions and \(D_3\)-paths with a prescribed endvertex2000-06-22Paper
Vertex-disjoint claws in graphs2000-04-10Paper
Lower bounds for the number of edge-crossings over the spine in a topological book embedding of a graph2000-04-09Paper
Connected subgraphs with small degree sums in 3-connected planar graphs1999-07-07Paper
Pyramidal tours with step-backs and the asymmetric traveling salesman problem1998-12-13Paper
Uniform Intersecting Families with Covering Number Restrictions1998-07-27Paper
On the pagenumber of complete bipartite graphs1998-05-24Paper
Every graph is an integral distance graph in the plane1998-03-12Paper
https://portal.mardi4nfdi.de/entity/Q43514661998-01-15Paper
Diagonal transformations of graphs and Dehn twists of surfaces1997-08-12Paper
https://portal.mardi4nfdi.de/entity/Q31229021997-07-29Paper
Diagonal transformations in quadrangulations and Dehn twists preserving cycle parities1997-05-05Paper
Connected spanning subgraphs of 3-connected planar graphs1997-05-04Paper
Exponents of uniform \(L\)-systems1997-03-23Paper
Polynomial invariants of graphs. II1996-09-29Paper
Covers in uniform intersecting families and a counterexample to a conjecture of Lovász1996-07-09Paper
A degree condition for the existence of regular factors inK1,n-free graphs1996-07-08Paper
Cycles through prescribed vertices with large degree sum1996-05-30Paper
Note on irreducible triangulations of surfaces1996-03-31Paper
Non-contractible edges in a 3-connected graph1995-10-17Paper
Uniform intersecting families with covering number four1995-08-21Paper
Contractible triples in 3-connected graphs1994-05-05Paper
https://portal.mardi4nfdi.de/entity/Q42738561994-01-06Paper
The 3‐connected graphs having a longest cycle containing only three contractible edges1993-08-24Paper
https://portal.mardi4nfdi.de/entity/Q39905861992-06-28Paper
Regular factors in K1,n free graphs1992-06-25Paper
Longest cycles in 3-connected graphs contain three contractible edges1989-01-01Paper
The number of contractible edges in 3-connected graphs1988-01-01Paper
A sufficient condition for a bipartite graph to have a k‐factor1988-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Katsuhiro Ota