Kenta Ozeki

According to our database1, Kenta Ozeki authored at least 88 papers between 2008 and 2020.

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



In proceedings 
PhD thesis 


Online presence:



A complete bipartite graph without properly colored cycles of length four.
J. Graph Theory, 2020

Orientations of graphs avoiding given lists on out-degrees.
J. Graph Theory, 2020

Long Paths in Bipartite Graphs and Path-Bistar Bipartite Ramsey Numbers.
Graphs Comb., 2020

On minimum leaf spanning trees and a criticality notion.
Discret. Math., 2020

Thomassen's conjecture for line graphs of 3-hypergraphs.
Discret. Math., 2020

Book Embedding of Graphs on the Projective Plane.
SIAM J. Discret. Math., 2019

Extension to 3-Colorable Triangulations.
SIAM J. Discret. Math., 2019

Spanning bipartite quadrangulations of even triangulations.
J. Graph Theory, 2019

A note on a Brooks' type theorem for DP?coloring.
J. Graph Theory, 2019

Hamiltonicity of planar graphs with a forbidden minor.
J. Graph Theory, 2019

Highly edge-connected factors using given lists on degrees.
J. Graph Theory, 2019

[a, b]-factors of graphs on surfaces.
Discret. Math., 2019

On the minimum leaf number of cubic graphs.
Discret. Math., 2019

A Degree Sum Condition on the Order, the Connectivity and the Independence Number for Hamiltonicity.
Electron. J. Comb., 2019

Types of triangle in Hamiltonian triangulations and an application to domination and <i>k</i>-walks.
Ars Math. Contemp., 2019

Every 4-Connected Graph with Crossing Number 2 is Hamiltonian.
SIAM J. Discret. Math., 2018

Grünbaum colorings of even triangulations on surfaces.
J. Graph Theory, 2018

On homeomorphically irreducible spanning trees in cubic graphs.
J. Graph Theory, 2018

Decomposing planar cubic graphs.
J. Graph Theory, 2018

Sufficient conditions for the existence of a path-factor which are related to odd components.
J. Graph Theory, 2018

Non-hamiltonian triangulations with distant separating triangles.
Discret. Math., 2018

Hamiltonian properties of polyhedra with few 3-cuts - A survey.
Discret. Math., 2018

A sufficient condition for DP-4-colorability.
Discret. Math., 2018

Pairs of forbidden subgraphs and 2-connected supereulerian graphs.
Discret. Math., 2018

3-dynamic coloring of planar triangulations.
Discret. Math., 2018

On upper bounds for the independent transversal domination number.
Discret. Appl. Math., 2018

Least conflict choosability.
CoRR, 2018

Plane Triangulations Without a Spanning Halin Subgraph II.
SIAM J. Discret. Math., 2017

On Dominating Even Subgraphs in Cubic Graphs.
SIAM J. Discret. Math., 2017

Matching Extension Missing Vertices and Edges in Triangulations of Surfaces.
J. Graph Theory, 2017

On two conjectures about the proper connection number of graphs.
Discret. Math., 2017

Coloring of locally planar graphs with one color class small.
Australas. J Comb., 2017

5-Connected Toroidal Graphs are Hamiltonian-Connected.
SIAM J. Discret. Math., 2016

A Characterization of K<sub>2, 4</sub>-Minor-Free Graphs.
SIAM J. Discret. Math., 2016

Cyclic 4-Colorings of Graphs on Surfaces.
J. Graph Theory, 2016

Vertex Coloring of Graphs by Total 2-Weightings.
Graphs Comb., 2016

Decomposing plane cubic graphs.
Eur. J. Comb., 2016

m-dominating k-trees of graphs.
Discret. Math., 2016

Extension to Even Triangulations.
SIAM J. Discret. Math., 2015

Plane Triangulations Without a Spanning Halin Subgraph: Counterexamples to the Lovász-Plummer Conjecture on Halin Graphs.
SIAM J. Discret. Math., 2015

A Relationship Between Thomassen's Conjecture and Bondy's Conjecture.
SIAM J. Discret. Math., 2015

Spanning Trees with Vertices Having Large Degrees.
J. Graph Theory, 2015

4-connected projective-planar graphs are Hamiltonian-connected.
J. Comb. Theory, Ser. B, 2015

Equivalence of Jackson's and Thomassen's conjectures.
J. Comb. Theory, Ser. B, 2015

Spanning k-Forests with Large Components in K<sub>1, k+1</sub>-Free Graphs.
Graphs Comb., 2015

A Toughness Condition for a Spanning Tree With Bounded Total Excesses.
Graphs Comb., 2015

The Existence of Semi-colorings in a Graph.
Graphs Comb., 2015

The Chromatic Index of a Claw-Free Graph Whose Core has Maximum Degree 2.
Graphs Comb., 2015

2-factors with bounded number of components in claw-free graphs.
Discret. Math., 2015

{0, 2}-Degree free spanning forests in graphs.
Discret. Math., 2015

Spanning $k$-trees of Bipartite Graphs.
Electron. J. Comb., 2015

Improved Upper Bounds for Gallai-Ramsey Numbers of Paths and Cycles.
J. Graph Theory, 2014

Spanning closed walks and TSP in 3-connected planar graphs.
J. Comb. Theory, Ser. B, 2014

Spanning Trees with a Bounded Number of Branch Vertices in a Claw-Free Graph.
Graphs Comb., 2014

2-edge-Hamiltonian-connectedness of 4-connected plane graphs.
Eur. J. Comb., 2014

On the ratio of the domination number and the independent domination number in graphs.
Discret. Appl. Math., 2014

A necessary and sufficient condition for the existence of a spanning tree with specified vertices having large degrees.
Comb., 2014

Spanning Trees with Bounded Maximum Degrees of Graphs on Surfaces.
SIAM J. Discret. Math., 2013

4, 5 Is Not Coverable: A Counterexample to a Conjecture of Kaiser and Škrekovski.
SIAM J. Discret. Math., 2013

A simpler proof for the two disjoint odd cycles theorem.
J. Comb. Theory, Ser. B, 2013

Hamiltonian cycles in bipartite toroidal graphs with a partite set of degree four vertices.
J. Comb. Theory, Ser. B, 2013

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

Forbidden Subgraphs Generating Almost the Same Sets.
Comb. Probab. Comput., 2013

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

Hamiltonian cycles in bipartite quadrangulations on the torus.
J. Graph Theory, 2012

Claw-free graphs and 2-factors that separate independent vertices.
J. Graph Theory, 2012

Length of Longest Cycles in a Graph Whose Relative Length is at Least Two.
Graphs Comb., 2012

2-factors and independent sets on claw-free graphs.
Discret. Math., 2012

Spanning trees with a bounded number of leaves in a claw-free graph.
Ars Comb., 2012

2- and 3-factors of graphs on surfaces.
J. Graph Theory, 2011

Non-separating subgraphs after deleting many disjoint paths.
J. Comb. Theory, Ser. B, 2011

Spanning Trees: A Survey.
Graphs Comb., 2011

Hamilton cycles in 4-connected troidal triangulations.
Electron. Notes Discret. Math., 2011

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

Dominating cycles in triangle-free graphs.
Ars Comb., 2011

A simple algorithm for 4-coloring 3-colorable planar graphs.
Theor. Comput. Sci., 2010

The independence number condition for the existence of a spanning <i>f</i>-tree.
J. Graph Theory, 2010

A Spanning Tree with High Degree Vertices.
Graphs Comb., 2010

Rainbow Generalizations of Ramsey Theory: A Survey.
Graphs Comb., 2010

A <i>k</i>-Tree Containing Specified Vertices.
Graphs Comb., 2010

4-connected triangulations and 4-orderedness.
Discret. Math., 2010

Set-orderedness as a generalization of k-orderedness and cyclability.
Discret. Math., 2010

On relative length of longest paths and cycles.
J. Graph Theory, 2009

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

Hamiltonian cycles and dominating cycles passing through a linear forest.
Discret. Math., 2009

A degree sum condition for graphs to be prism hamiltonian.
Discret. Math., 2009

A Degree Sum Condition Concerning the Connectivity and the Independence Number of a Graph.
Graphs Comb., 2008

Long cycles in graphs without hamiltonian paths.
Discret. Math., 2008