Kenta Ozeki

ORCID

Publication Activity (10 Years)

Years Active: 2008-2024
Publications (10 Years): 81

Top Venues

Discret. Math.

J. Graph Theory

SIAM J. Discret. Math.

CoRR

Publications

Analen Malnegro, Kenta Ozeki
-colorings for 4-regular graphs. Discret. Math. 347 (3) (2024)
Pjotr Buys, Ross J. Kang, Kenta Ozeki
Reconfiguration of Independent Transversals. CoRR (2024)
Takehiro Ito, Yuni Iwamasa, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
Reconfiguration of Colorings in Triangulations of the Sphere. SoCG (2023)
Roman Cada, Michitaka Furuya, Kenji Kimura, Kenta Ozeki, Christopher Purcell, Takamasa Yashima
A necessary and sufficient condition for the existence of a properly coloured f-factor in an edge-coloured graph. CoRR (2023)
Yaping Mao, Kenta Ozeki, Aaron Robertson, Zhao Wang
Arithmetic progressions, quasi progressions, and Gallai-Ramsey colorings. J. Comb. Theory, Ser. A 193 (2023)
Michitaka Furuya, Naoki Matsumoto, Yumiko Ohno, Kenta Ozeki
Note on fair game edge-connectivity of graphs. Discret. Appl. Math. 333 (2023)
Kenta Ozeki, Masao Tsugaki
A Spanning Tree with at Most $k$ Leaves in a $K_{1,p}$-Free Graph. Electron. J. Comb. 30 (4) (2023)
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
On reachable assignments under dichotomous preferences. Theor. Comput. Sci. 979 (2023)
Seungjae Eom, Kenta Ozeki
A 2-Bisection with Small Number of Monochromatic Edges of a Claw-Free Cubic Graph. Graphs Comb. 39 (1) (2023)
Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
Rerouting Planar Curves and Disjoint Paths. ICALP (2023)
Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
Monotone Edge Flips to an Orientation of Maximum Edge-Connectivity à la Nash-Williams. ACM Trans. Algorithms 19 (1) (2023)
Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
Rerouting Planar Curves and Disjoint Paths. CoRR (2022)
Takehiro Ito, Yuni Iwamasa, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
Reconfiguration of colorings in triangulations of the sphere. CoRR (2022)
Shun-ichi Maezawa, Kenta Ozeki
A forbidden pair for connected graphs to have spanning k-trees. J. Graph Theory 99 (3) (2022)
Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
Monotone edge flips to an orientation of maximum edge-connectivity à la Nash-Williams. SODA (2022)
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
On Reachable Assignments under Dichotomous Preferences. CoRR (2022)
Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
Reforming an Envy-Free Matching. CoRR (2022)
Kenta Ozeki
Kempe Equivalence Classes of Cubic Graphs Embedded on the Projective Plane. Comb. 42 (Supplement 2) (2022)
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
On Reachable Assignments Under Dichotomous Preferences. PRIMA (2022)
Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
Reforming an Envy-Free Matching. AAAI (2022)
Raiji Mukae, Kenta Ozeki, Terukazu Sano, Ryuji Tazume
Covering projective planar graphs with three forests. Discret. Math. 345 (4) (2022)
Toshiki Abe, Seog-Jin Kim, Kenta Ozeki
-minor-free graphs. Discret. Math. 345 (4) (2022)
Nastaran Haghparast, Kenta Ozeki
2-Factors of cubic bipartite graphs. Discret. Math. 344 (7) (2021)
Kengo Enami, Kenta Ozeki, Tomoki Yamaguchi
Proper Colorings of Plane Quadrangulations Without Rainbow Faces. Graphs Comb. 37 (5) (2021)
Yasuko Matsui, Kenta Ozeki
A Note on Enumeration of 3-Edge-Connected Spanning Subgraphs in Plane Graphs. IEICE Trans. Inf. Syst. (3) (2021)
Zdenek Dvorák, Louis Esperet, Ross J. Kang, Kenta Ozeki
Single-conflict colouring. J. Graph Theory 97 (1) (2021)
Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
Monotone edge flips to an orientation of maximum edge-connectivity à la Nash-Williams. CoRR (2021)
Kenta Ozeki, Gábor Wiener, Carol T. Zamfirescu
On minimum leaf spanning trees and a criticality notion. Discret. Math. 343 (7) (2020)
Michitaka Furuya, Shun-ichi Maezawa, Kenta Ozeki
Long Paths in Bipartite Graphs and Path-Bistar Bipartite Ramsey Numbers. Graphs Comb. 36 (1) (2020)
Saieed Akbari, Mina Dalirrooyfard, K. Ehsani, Kenta Ozeki, R. Sherkati
Orientations of graphs avoiding given lists on out-degrees. J. Graph Theory 93 (4) (2020)
Roman Cada, Kenta Ozeki, Kiyoshi Yoshimoto
A complete bipartite graph without properly colored cycles of length four. J. Graph Theory 93 (2) (2020)
Binlong Li, Kenta Ozeki, Zdenek Ryjácek, Petr Vrána
Thomassen's conjecture for line graphs of 3-hypergraphs. Discret. Math. 343 (6) (2020)
Jan Goedgebeur, Kenta Ozeki, Nico Van Cleemput, Gábor Wiener
On the minimum leaf number of cubic graphs. Discret. Math. 342 (11) (2019)
Atsuhiro Nakamoto, Kenta Noguchi, Kenta Ozeki
Extension to 3-Colorable Triangulations. SIAM J. Discret. Math. 33 (3) (2019)
Mark N. Ellingham, Emily A. Marshall, Kenta Ozeki, Shoichi Tsuchiya
Hamiltonicity of planar graphs with a forbidden minor. J. Graph Theory 90 (4) (2019)
Gunnar Brinkmann, Kenta Ozeki, Nico Van Cleemput
-walks. Ars Math. Contemp. 17 (1) (2019)
Seog-Jin Kim, Kenta Ozeki
A note on a Brooks' type theorem for DP?coloring. J. Graph Theory 91 (2) (2019)
Ryota Matsubara, Haruhide Matsuda, Nana Matsuo, Kenta Noguchi, Kenta Ozeki
[a, b]-factors of graphs on surfaces. Discret. Math. 342 (7) (2019)
Kenta Ozeki, Atsuhiro Nakamoto, Takayuki Nozawa
Book Embedding of Graphs on the Projective Plane. SIAM J. Discret. Math. 33 (4) (2019)
Shuya Chiba, Michitaka Furuya, Kenta Ozeki, Masao Tsugaki, Tomoki Yamashita
A Degree Sum Condition on the Order, the Connectivity and the Independence Number for Hamiltonicity. Electron. J. Comb. 26 (4) (2019)
Nastaran Haghparast, Mikio Kano, Shun-ichi Maezawa, Kenta Ozeki
Connected odd factors of graphs. Australas. J Comb. 73 (2019)
Atsuhiro Nakamoto, Kenta Noguchi, Kenta Ozeki
Spanning bipartite quadrangulations of even triangulations. J. Graph Theory 90 (3) (2019)
Saieed Akbari, Morteza Hasanvand, Kenta Ozeki
Highly edge-connected factors using given lists on degrees. J. Graph Theory 90 (2) (2019)
Kenta Ozeki
Hamiltonicity of Graphs on Surfaces in Terms of Toughness and Scattering Number - A Survey. JCDCGGG (2018)
Yoshihiro Asayama, Yuki Kawasaki, Seog-Jin Kim, Atsuhiro Nakamoto, Kenta Ozeki
3-dynamic coloring of planar triangulations. Discret. Math. 341 (11) (2018)
Kenta Ozeki, Carol T. Zamfirescu
Non-hamiltonian triangulations with distant separating triangles. Discret. Math. 341 (7) (2018)
Jan Goedgebeur, Kenta Ozeki, Nico Van Cleemput, Gábor Wiener
On the minimum leaf number of cubic graphs. CoRR (2018)
Yoshimi Egawa, Michitaka Furuya, Kenta Ozeki
Sufficient conditions for the existence of a path-factor which are related to odd components. J. Graph Theory 89 (3) (2018)
Zdenek Dvorák, Louis Esperet, Ross J. Kang, Kenta Ozeki
Least conflict choosability. CoRR (2018)
Roman Cada, Kenta Ozeki, Liming Xiong, Kiyoshi Yoshimoto
Pairs of forbidden subgraphs and 2-connected supereulerian graphs. Discret. Math. 341 (6) (2018)
Christoph Brause, Michael A. Henning, Kenta Ozeki, Ingo Schiermeyer, Elkin Vumar
On upper bounds for the independent transversal domination number. Discret. Appl. Math. 236 (2018)
Kenta Ozeki, Nico Van Cleemput, Carol T. Zamfirescu
Hamiltonian properties of polyhedra with few 3-cuts - A survey. Discret. Math. 341 (9) (2018)
Kenta Ozeki, Carol T. Zamfirescu
Every 4-Connected Graph with Crossing Number 2 is Hamiltonian. SIAM J. Discret. Math. 32 (4) (2018)
Seog-Jin Kim, Kenta Ozeki
A sufficient condition for DP-4-colorability. Discret. Math. 341 (7) (2018)
Arthur Hoffmann-Ostenhof, Kenta Noguchi, Kenta Ozeki
On homeomorphically irreducible spanning trees in cubic graphs. J. Graph Theory 89 (2) (2018)
Arthur Hoffmann-Ostenhof, Tomás Kaiser, Kenta Ozeki
Decomposing planar cubic graphs. J. Graph Theory 88 (4) (2018)
Michal Kotrbcík, Naoki Matsumoto, Bojan Mohar, Atsuhiro Nakamoto, Kenta Noguchi, Kenta Ozeki, Andrej Vodopivec
Grünbaum colorings of even triangulations on surfaces. J. Graph Theory 87 (4) (2018)
Atsuhiro Nakamoto, Kenta Ozeki
Coloring of locally planar graphs with one color class small. Australas. J Comb. 67 (2017)
Ken-ichi Kawarabayashi, Kenta Ozeki, Michael D. Plummer
Matching Extension Missing Vertices and Edges in Triangulations of Surfaces. J. Graph Theory 85 (1) (2017)
Fei Huang, Xueliang Li, Zhongmei Qin, Colton Magnant, Kenta Ozeki
On two conjectures about the proper connection number of graphs. Discret. Math. 340 (9) (2017)
Guantao Chen, Hikoe Enomoto, Kenta Ozeki, Shoichi Tsuchiya
Plane Triangulations Without a Spanning Halin Subgraph II. SIAM J. Discret. Math. 31 (4) (2017)
Roman Cada, Shuya Chiba, Kenta Ozeki, Kiyoshi Yoshimoto
On Dominating Even Subgraphs in Cubic Graphs. SIAM J. Discret. Math. 31 (2) (2017)
Atsuhiro Nakamoto, Kenta Noguchi, Kenta Ozeki
Cyclic 4-Colorings of Graphs on Surfaces. J. Graph Theory 82 (3) (2016)
Mark N. Ellingham, Emily A. Marshall, Kenta Ozeki, Shoichi Tsuchiya
-Minor-Free Graphs. SIAM J. Discret. Math. 30 (2) (2016)
Mikio Kano, Kenta Ozeki, Masao Tsugaki, Guiying Yan
m-dominating k-trees of graphs. Discret. Math. 339 (2) (2016)
Kenta Ozeki, Dong Ye
Decomposing plane cubic graphs. Eur. J. Comb. 52 (2016)
Ken-ichi Kawarabayashi, Kenta Ozeki
5-Connected Toroidal Graphs are Hamiltonian-Connected. SIAM J. Discret. Math. 30 (1) (2016)
Jonathan Hulgan, Jeno Lehel, Kenta Ozeki, Kiyoshi Yoshimoto
Vertex Coloring of Graphs by Total 2-Weightings. Graphs Comb. 32 (6) (2016)
Guantao Chen, Hikoe Enomoto, Kenta Ozeki, Shoichi Tsuchiya
Plane Triangulations Without a Spanning Halin Subgraph: Counterexamples to the Lovász-Plummer Conjecture on Halin Graphs. SIAM J. Discret. Math. 29 (3) (2015)
Kenta Ozeki
A Toughness Condition for a Spanning Tree With Bounded Total Excesses. Graphs Comb. 31 (5) (2015)
Mikio Kano, Kenta Ozeki, Kazuhiro Suzuki, Masao Tsugaki, Tomoki Yamashita
Spanning $k$-trees of Bipartite Graphs. Electron. J. Comb. 22 (1) (2015)
Ken-ichi Kawarabayashi, Kenta Ozeki
4-connected projective-planar graphs are Hamiltonian-connected. J. Comb. Theory, Ser. B 112 (2015)
Kenta Ozeki, Zdenek Ryjácek, Kiyoshi Yoshimoto
2-factors with bounded number of components in claw-free graphs. Discret. Math. 338 (5) (2015)
Roman Cada, Shuya Chiba, Kenta Ozeki, Petr Vrána, Kiyoshi Yoshimoto
A Relationship Between Thomassen's Conjecture and Bondy's Conjecture. SIAM J. Discret. Math. 29 (1) (2015)
Kenta Ozeki, Takeshi Sugiyama
-Free Graphs. Graphs Comb. 31 (5) (2015)
Saieed Akbari, Maryam Ghanbari, Kenta Ozeki
The Chromatic Index of a Claw-Free Graph Whose Core has Maximum Degree 2. Graphs Comb. 31 (4) (2015)
Saieed Akbari, Kenta Ozeki, Alireza Rezaei, Rahmtin Rotabi, Sara Sabour
{0, 2}-Degree free spanning forests in graphs. Discret. Math. 338 (7) (2015)
Yoshimi Egawa, Kenta Ozeki
Spanning Trees with Vertices Having Large Degrees. J. Graph Theory 79 (3) (2015)
Roman Cada, Shuya Chiba, Kenta Ozeki, Petr Vrána, Kiyoshi Yoshimoto
Equivalence of Jackson's and Thomassen's conjectures. J. Comb. Theory, Ser. B 114 (2015)
Michitaka Furuya, Masaru Kamada, Kenta Ozeki
The Existence of Semi-colorings in a Graph. Graphs Comb. 31 (5) (2015)
Atsuhiro Nakamoto, Kenta Noguchi, Kenta Ozeki
Extension to Even Triangulations. SIAM J. Discret. Math. 29 (4) (2015)
Yoshimi Egawa, Kenta Ozeki
A necessary and sufficient condition for the existence of a spanning tree with specified vertices having large degrees. Comb. 34 (1) (2014)
Ken-ichi Kawarabayashi, Kenta Ozeki
Spanning closed walks and TSP in 3-connected planar graphs. J. Comb. Theory, Ser. B 109 (2014)
Haruhide Matsuda, Kenta Ozeki, Tomoki Yamashita
Spanning Trees with a Bounded Number of Branch Vertices in a Claw-Free Graph. Graphs Comb. 30 (2) (2014)
Kenta Ozeki, Petr Vrána
2-edge-Hamiltonian-connectedness of 4-connected plane graphs. Eur. J. Comb. 35 (2014)
Martin Hall, Colton Magnant, Kenta Ozeki, Masao Tsugaki
Improved Upper Bounds for Gallai-Ramsey Numbers of Paths and Cycles. J. Graph Theory 75 (1) (2014)
Michitaka Furuya, Kenta Ozeki, Akinari Sasaki
On the ratio of the domination number and the independent domination number in graphs. Discret. Appl. Math. 178 (2014)
Ken-ichi Kawarabayashi, Kenta Ozeki
4-connected projective-planar graphs are hamiltonian-connected. SODA (2013)
Shinya Fujita, Michitaka Furuya, Kenta Ozeki
Forbidden Subgraphs Generating Almost the Same Sets. Comb. Probab. Comput. 22 (5) (2013)
Katsuhiro Ota, Kenta Ozeki, Gabriel Sueiro
Forbidden induced subgraphs for near perfect matchings. Discret. Math. 313 (11) (2013)
Kenta Ozeki
Spanning Trees with Bounded Maximum Degrees of Graphs on Surfaces. SIAM J. Discret. Math. 27 (1) (2013)
Ken-ichi Kawarabayashi, Kenta Ozeki
A simpler proof for the two disjoint odd cycles theorem. J. Comb. Theory, Ser. B 103 (3) (2013)
Jun Fujisawa, Atsuhiro Nakamoto, Kenta Ozeki
Hamiltonian cycles in bipartite toroidal graphs with a partite set of degree four vertices. J. Comb. Theory, Ser. B 103 (1) (2013)
Roman Cada, Shuya Chiba, Kenta Ozeki, Petr Vrána, Kiyoshi Yoshimoto
4, 5 Is Not Coverable: A Counterexample to a Conjecture of Kaiser and Škrekovski. SIAM J. Discret. Math. 27 (1) (2013)
Kenta Ozeki, Tomoki Yamashita
Length of Longest Cycles in a Graph Whose Relative Length is at Least Two. Graphs Comb. 28 (6) (2012)
Atsuhiro Nakamoto, Katsuhiro Ota, Kenta Ozeki
Book Embedding of Toroidal Bipartite Graphs. SIAM J. Discret. Math. 26 (2) (2012)
Roman Kuzel, Kenta Ozeki, Kiyoshi Yoshimoto
2-factors and independent sets on claw-free graphs. Discret. Math. 312 (2) (2012)
Mikio Kano, Aung Kyaw, Haruhide Matsuda, Kenta Ozeki, Akira Saito, Tomoki Yamashita
Spanning trees with a bounded number of leaves in a claw-free graph. Ars Comb. 103 (2012)
Ken-ichi Kawarabayashi, Kenta Ozeki
Spanning closed walks and TSP in 3-connected planar graphs. SODA (2012)
Atsuhiro Nakamoto, Kenta Ozeki
Hamiltonian cycles in bipartite quadrangulations on the torus. J. Graph Theory 69 (2) (2012)

Kenta Ozeki.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Kenta Ozeki