Kenta Ozeki

1.0k total citations
97 papers, 528 citations indexed

About

Kenta Ozeki is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Computer Graphics and Computer-Aided Design. According to data from OpenAlex, Kenta Ozeki has authored 97 papers receiving a total of 528 indexed citations (citations by other indexed papers that have themselves been cited), including 93 papers in Computational Theory and Mathematics, 46 papers in Discrete Mathematics and Combinatorics and 22 papers in Computer Graphics and Computer-Aided Design. Recurrent topics in Kenta Ozeki's work include Advanced Graph Theory Research (91 papers), Graph Labeling and Dimension Problems (46 papers) and Limits and Structures in Graph Theory (42 papers). Kenta Ozeki is often cited by papers focused on Advanced Graph Theory Research (91 papers), Graph Labeling and Dimension Problems (46 papers) and Limits and Structures in Graph Theory (42 papers). Kenta Ozeki collaborates with scholars based in Japan, United States and Czechia. Kenta Ozeki's co-authors include Colton Magnant, Shinya Fujita, Tomoki Yamashita, Seog‐Jin Kim, Ken‐ichi Kawarabayashi, Atsuhiro Nakamoto, Katsuhiro Ota, Dong Ye, Yoshimi Egawa and Tomáš Kaiser and has published in prestigious journals such as SHILAP Revista de lepidopterología, Theoretical Computer Science and Discrete Applied Mathematics.

In The Last Decade

Kenta Ozeki

87 papers receiving 508 citations

Peers

Kenta Ozeki
Tomáš Kaiser Czechia
Paul Wollan Italy
Bernard Lidický United States
Michael Stiebitz Germany
Kathie Cameron Canada
André Kündgen United States
V. G. Vizing Ukraine
H.J. Veldman Netherlands
Stanley Fiorini United Kingdom
Bert L. Hartnell Canada
Tomáš Kaiser Czechia
Kenta Ozeki
Citations per year, relative to Kenta Ozeki Kenta Ozeki (= 1×) peers Tomáš Kaiser

Countries citing papers authored by Kenta Ozeki

Since Specialization
Citations

This map shows the geographic impact of Kenta Ozeki's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Kenta Ozeki with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Kenta Ozeki more than expected).

Fields of papers citing papers by Kenta Ozeki

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Kenta Ozeki. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Kenta Ozeki. The network helps show where Kenta Ozeki may publish in the future.

Co-authorship network of co-authors of Kenta Ozeki

This figure shows the co-authorship network connecting the top 25 collaborators of Kenta Ozeki. A scholar is included among the top collaborators of Kenta Ozeki based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Kenta Ozeki. Kenta Ozeki is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Ozeki, Kenta, et al.. (2023). H-colorings for 4-regular graphs. Discrete Mathematics. 347(3). 113844–113844.
2.
Dvořák, Zdenĕk, Louis Esperet, Ross J. Kang, & Kenta Ozeki. (2020). Single‐conflict colouring. Journal of Graph Theory. 97(1). 148–160. 8 indexed citations
3.
Ozeki, Kenta, et al.. (2020). On minimum leaf spanning trees and a criticality notion. Discrete Mathematics. 343(7). 111884–111884. 2 indexed citations
4.
Ozeki, Kenta, et al.. (2019). [a,b]-factors of graphs on surfaces. Discrete Mathematics. 342(7). 1979–1988. 2 indexed citations
5.
Kim, Seog‐Jin, et al.. (2018). 3-dynamic coloring of planar triangulations. Discrete Mathematics. 341(11). 2988–2994. 3 indexed citations
6.
Ozeki, Kenta, et al.. (2018). Non-hamiltonian triangulations with distant separating triangles. Discrete Mathematics. 341(7). 1900–1902. 1 indexed citations
7.
Ozeki, Kenta, et al.. (2018). Pairs of forbidden subgraphs and 2-connected supereulerian graphs. Discrete Mathematics. 341(6). 1696–1707. 5 indexed citations
8.
Huang, Fei, et al.. (2017). On two conjectures about the proper connection number of graphs. Discrete Mathematics. 340(9). 2217–2222. 9 indexed citations
9.
Ozeki, Kenta, et al.. (2015). Equivalence of Jackson's and Thomassen's conjectures. Journal of Combinatorial Theory Series B. 114. 124–147. 1 indexed citations
10.
Ozeki, Kenta & Dong Ye. (2015). Decomposing plane cubic graphs. European Journal of Combinatorics. 52. 40–46. 10 indexed citations
11.
Kawarabayashi, Ken‐ichi & Kenta Ozeki. (2014). 4-connected projective-planar graphs are Hamiltonian-connected. Journal of Combinatorial Theory Series B. 112. 36–69. 3 indexed citations
12.
Kawarabayashi, Ken‐ichi & Kenta Ozeki. (2014). Spanning closed walks and TSP in 3-connected planar graphs. Journal of Combinatorial Theory Series B. 109. 1–33. 1 indexed citations
13.
Ozeki, Kenta, et al.. (2013). 2-edge-Hamiltonian-connectedness of 4-connected plane graphs. European Journal of Combinatorics. 35. 432–448. 8 indexed citations
14.
Kawarabayashi, Ken‐ichi & Kenta Ozeki. (2013). 4-connected projective-planar graphs are hamiltonian-connected. Symposium on Discrete Algorithms. 378–395. 3 indexed citations
15.
Kanō, Mikio, et al.. (2012). Spanning trees with a bounded number of leaves in a claw-free graph. Ars Combinatoria. 103. 137–154. 13 indexed citations
16.
Kawarabayashi, Ken‐ichi & Kenta Ozeki. (2012). Spanning closed walks and TSP in 3-connected planar graphs. Symposium on Discrete Algorithms. 671–682. 1 indexed citations
17.
Nakamoto, Atsuhiro, et al.. (2012). Hamiltonian cycles in bipartite toroidal graphs with a partite set of degree four vertices. Journal of Combinatorial Theory Series B. 103(1). 46–60. 1 indexed citations
18.
Ota, Katsuhiro, et al.. (2011). Forbidden induced subgraphs for star-free graphs. Discrete Mathematics. 311(21). 2475–2484. 4 indexed citations
19.
Kawarabayashi, Ken‐ichi & Kenta Ozeki. (2010). Non-separating subgraphs after deleting many disjoint paths. Journal of Combinatorial Theory Series B. 101(1). 54–59. 2 indexed citations
20.
Kawarabayashi, Ken‐ichi, Kenta Ozeki, & Tomoki Yamashita. (2007). Long cycles in graphs without hamiltonian paths. Discrete Mathematics. 308(24). 5899–5906. 2 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by Tomáš Kaiser Breakdown of academic impact, for papers by Paul Wollan Breakdown of academic impact, for papers by Bernard Lidický Breakdown of academic impact, for papers by Michael Stiebitz Breakdown of academic impact, for papers by Kathie Cameron Breakdown of academic impact, for papers by André Kündgen Breakdown of academic impact, for papers by V. G. Vizing Breakdown of academic impact, for papers by H.J. Veldman Breakdown of academic impact, for papers by Stanley Fiorini Breakdown of academic impact, for papers by Bert L. Hartnell
Rankless by CCL
2026