Katsuhiro Ota

According to our database1, Katsuhiro Ota authored at least 81 papers between 1988 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Some conditions for hamiltonian cycles in 1-tough (<i>K</i><sub>2</sub> ∪ <i>kK</i><sub>1</sub>)-free graphs.
Discret. Math., March, 2024

2023
Minimum degree conditions for the existence of a sequence of cycles whose lengths differ by one or two.
J. Graph Theory, June, 2023

2022
Hamiltonian cycles in 2-tough 2 K 2 $2{K}_{2}$ -free graphs.
J. Graph Theory, 2022

Graph grabbing game on totally-weighted graphs.
Discret. Appl. Math., 2022

2021
Preface to the special issue dedicated to Professors Eiichi Bannai and Hikoe Enomoto on their 75th birthdays.
Graphs Comb., 2021

2020
Color degree sum conditions for properly colored spanning trees in edge-colored graphs.
Discret. Math., 2020

2015
Disjoint Chorded Cycles of the Same Length.
SIAM J. Discret. Math., 2015

Edge Proximity Conditions for Extendability in Planar Triangulations.
J. Graph Theory, 2015

Hadwiger's conjecture for degree sequences.
J. Comb. Theory, Ser. B, 2015

Preface.
Graphs Comb., 2015

2013
Forbidden Induced Subgraphs for Toughness.
J. Graph Theory, 2013

Forbidden Induced Subgraphs for Perfect Matchings.
Graphs Comb., 2013

Forbidden induced subgraphs for near perfect matchings.
Discret. Math., 2013

2012
Book Embedding of Toroidal Bipartite Graphs.
SIAM J. Discret. Math., 2012

Maximal <i>K</i>3's and Hamiltonicity of 4-connected claw-free graphs.
J. Graph Theory, 2012

Hamiltonian cycles with all small even chords.
Discret. Math., 2012

2011
Forbidden triples for perfect matchings.
J. Graph Theory, 2011

The existence of a 2-factor in <i>K</i><sub>1, <i>n</i></sub>-free graphs with large connectivity and large edge-connectivity.
J. Graph Theory, 2011

N-flips in even triangulations on the torus and Dehn twists preserving monodromies.
Discret. Math., 2011

Forbidden induced subgraphs for star-free graphs.
Discret. Math., 2011

Toughness of <i>K<sub>a,t</sub></i>-Minor-Free Graphs.
Electron. J. Comb., 2011

Spanning Trees with Bounded Total Excess.
Ars Comb., 2011

2010
Forbidden subgraphs and the existence of spanning k-trees.
Discret. Math., 2010

2009
Spanning trees in 3-connected K<sub>3, t</sub>-minor-free graphs.
Electron. Notes Discret. Math., 2009

3-trees with few vertices of degree 3 in circuit graphs.
Discret. Math., 2009

2008
Forbidden subgraphs and the existence of paths and cycles passing through specified vertices.
Discret. Math., 2008

K<sub>1, 3</sub>-factors in graphs.
Discret. Math., 2008

2007
Chvátal Erdós condition and 2-factors with a specyfied number of components.
Discuss. Math. Graph Theory, 2007

Independence number and vertex-disjoint cycles.
Discret. Math., 2007

2006
A pair of forbidden subgraphs and perfect matchings.
J. Comb. Theory, Ser. B, 2006

Weighted Ramsey problem.
Australas. J Comb., 2006

2005
Ore-type degree condition for heavy paths in weighted graphs.
Discret. Math., 2005

A sk type condition for heavy cycles in weighted graphs.
Ars Comb., 2005

2004
Vertex-disjoint cycles containing specified vertices in a bipartite graph.
J. Graph Theory, 2004

Planar triangulations which quadrangulate other surfaces.
Eur. J. Comb., 2004

2003
2-connected 7-coverings of 3-connected graphs on surfaces.
J. Graph Theory, 2003

Subgraphs of graphs on surfaces with high representativity .
J. Comb. Theory, Ser. B, 2003

Diagonal Flips in Hamiltonian Triangulations on the Sphere.
Graphs Comb., 2003

2002
Hamiltonian cycles in <i>n</i>-extendable graphs.
J. Graph Theory, 2002

Path factors in cubic graphs.
J. Graph Theory, 2002

The Diameters of Some Transition Graphs Constructed from Hamilton Cycles.
Graphs Comb., 2002

On minimally 3-connected graphs on a surface.
Electron. Notes Discret. Math., 2002

On 3-coloring of plane triangulations.
Electron. Notes Discret. Math., 2002

Chromatic Numbers and Cycle Parities of Quadrangulations on Nonorientable Closed Surfaces.
Electron. Notes Discret. Math., 2002

On separable self-complementary graphs.
Discret. Math., 2002

On a hamiltonian cycle in which specified vertices are not isolated.
Discret. Math., 2002

Choice number of some complete multi-partite graphs.
Discret. Math., 2002

2001
Chromatic numbers of quadrangulations on closed surfaces.
J. Graph Theory, 2001

Vertex-Disjoint Stars in Graphs.
Discuss. Math. Graph Theory, 2001

Hamiltonian cycles in <i>n</i>-factor-critical graphs.
Discret. Math., 2001

Vertex-Disjoint Paths in Graphs.
Ars Comb., 2001

Vertex-disjoint cycles containing specified edges in a bipartite graph.
Australas. J Comb., 2001

2000
Partitions of a graph into paths with prescribed endvertices and lengths.
J. Graph Theory, 2000

On Minimally (n, )-Connected Graphs.
J. Comb. Theory, Ser. B, 2000

Graph decompositions and <i>D</i><sub>3</sub>-paths with a prescribed endvertex.
Discret. Math., 2000

1999
Connected subgraphs with small degree sums in 3-connected planar graphs.
J. Graph Theory, 1999

Vertex-disjoint claws in graphs.
Discret. Math., 1999

Lower Bounds for the Number of Edge-crossings Over the Spine in a Topological Book Embedding of a Graph.
Discret. Appl. Math., 1999

1998
Pyramidal Tours with Step-backs and the Asymmetric Traveling Salesman Problem.
Discret. Appl. Math., 1998

Uniform Intersecting Families with Covering Number Restrictions.
Comb. Probab. Comput., 1998

1997
Long cycles passing through a specified edge in a 3-connected graph.
J. Graph Theory, 1997

Diagonal Transformations in Quadrangulations and Dehn Twists Preserving Cycle Parities.
J. Comb. Theory, Ser. B, 1997

Diagonal Transformations of Graphs and Dehn Twists of Surfaces.
J. Comb. Theory, Ser. B, 1997

Every Graph Is an Integral Distance Graph in the Plane.
J. Comb. Theory, Ser. A, 1997

On the Pagenumber of Complete Bipartite Graphs.
J. Comb. Theory, Ser. B, 1997

1996
A degree condition for the existence of regular factors in <i>K</i><sub>1, <i>n</i></sub>-free graphs.
J. Graph Theory, 1996

Covers in Uniform Intersecting Families and a Counterexample to a Conjecture of Lovász.
J. Comb. Theory, Ser. A, 1996

Exponents of Uniform L-Systems.
J. Comb. Theory, Ser. A, 1996

Connected Spanning Subgraphs of 3-Connected Planar Graphs.
J. Comb. Theory, Ser. B, 1996

Polynomial invariants of graphs II.
Graphs Comb., 1996

1995
Note on irreducible triangulations of surfaces.
J. Graph Theory, 1995

Uniform Intersecting Families with Covering Number Four.
J. Comb. Theory, Ser. A, 1995

Cycles through prescribed vertices with large degree sum.
Discret. Math., 1995

Non-Contractible Edges in A 3-Connected Graph.
Comb., 1995

1994
Contractile Triples in 3-Connected Graphs.
J. Comb. Theory, Ser. B, 1994

1993
The 3-connected graphs having a longest cycle containing only three contractible edges.
J. Graph Theory, 1993

1991
Regular factors in <i>K</i><sub>1, <i>n</i></sub> free graphs.
J. Graph Theory, 1991

2-factors, connectivity, and graph minors.
Proceedings of the Graph Structure Theory, 1991

1989
Longest cycles in 3-connected graphs contain three contractible edges.
J. Graph Theory, 1989

1988
A sufficient condition for a bipartite graph to have a <i>k</i>-factor.
J. Graph Theory, 1988

The number of contractible edges in 3-connected graphs.
Graphs Comb., 1988


  Loading...