Kenta Ozeki - RankMe

132 papers A* 6B 1Journal 124Unranked 1

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	List orientation number of graphs. Discret. Appl. Math. Toshiki Abe, Kenta Ozeki
2025	J	`jnl`	2-Connected spanning subgraphs of circuit graphs. Discret. Math. Atsuhiro Nakamoto, Kenta Ozeki, Daiki Takahashi
2025	J	`jnl`	A spanning tree with at most k leaves in a K1,5-free graph. Discret. Math. Pei Sun, Yuan Chen, Masahiro Kimura, Kenta Ozeki, Masao Tsugaki
2025	J	`jnl`	An odd 4-coloring of a maximal outerplanar graph. Discret. Math. Masaki Kashima, Shun-ichi Maezawa, Kakeru Osako, Kenta Ozeki, Shoichi Tsuchiya
2025	J	`jnl`	Brooks' Type Theorem for Indicated Coloring Game. Graphs Comb. Haruki Kawabe, Yosuke Kobayashi, Shieri Kojima, Kenta Ozeki
2025	J	`jnl`	Coloring zonotopal quadrangulations of the projective space. Eur. J. Comb. Masahiro Hachimori, Atsuhiro Nakamoto, Kenta Ozeki
2025	J	`jnl`	On k-Edge-Hamilton-Connected Line Graphs. J. Graph Theory Baoleer, Kenta Ozeki
2025	J	`jnl`	Reconfiguration of colorings in triangulations of the sphere. J. Comput. Geom. Takehiro Ito, Yuni Iwamasa, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2025	J	`jnl`	Reforming an Envy-Free Matching. Algorithmica Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2025	J	`jnl`	Rerouting Planar Curves and Disjoint Paths. ACM Trans. Algorithms Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2025	J	`jnl`	Spanning Path-Cycle Systems with Given End-Vertices in Regular Graphs. Graphs Comb. Yoshimi Egawa, Mikio Kano, Kenta Ozeki
2024	J	`jnl`	On strict-double-bound graphs and Cartesian products of paths and cycles. Discret. Math. Algorithms Appl. Yoshimi Egawa, Kenjiro Ogawa, Kenta Ozeki, Satoshi Tagusari, Morimasa Tsuchiya
2024	J	`jnl`	Reconfiguration of Independent Transversals. CoRR Pjotr Buys, Ross J. Kang, Kenta Ozeki
2023	J	`jnl`	A 2-Bisection with Small Number of Monochromatic Edges of a Claw-Free Cubic Graph. Graphs Comb. Seungjae Eom, Kenta Ozeki
2023	J	`jnl`	A Spanning Tree with at Most $k$ Leaves in a $K_{1,p}$-Free Graph. Electron. J. Comb. Kenta Ozeki, Masao Tsugaki
2023	J	`jnl`	A necessary and sufficient condition for the existence of a properly coloured f-factor in an edge-coloured graph. CoRR Roman Cada, Michitaka Furuya, Kenji Kimura, Kenta Ozeki, Christopher Purcell, Takamasa Yashima
2023	J	`jnl`	Arithmetic progressions, quasi progressions, and Gallai-Ramsey colorings. J. Comb. Theory A Yaping Mao, Kenta Ozeki, Aaron Robertson, Zhao Wang
2023	J	`jnl`	Monotone Edge Flips to an Orientation of Maximum Edge-Connectivity à la Nash-Williams. ACM Trans. Algorithms Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2023	J	`jnl`	Note on fair game edge-connectivity of graphs. Discret. Appl. Math. Michitaka Furuya, Naoki Matsumoto, Yumiko Ohno, Kenta Ozeki
2023	J	`jnl`	On reachable assignments under dichotomous preferences. Theor. Comput. Sci. Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2023	A*	`conf`	Reconfiguration of Colorings in Triangulations of the Sphere. SoCG Takehiro Ito, Yuni Iwamasa, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2023	A*	`conf`	Rerouting Planar Curves and Disjoint Paths. ICALP Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2022	J	`jnl`	A forbidden pair for connected graphs to have spanning k-trees. J. Graph Theory Shun-ichi Maezawa, Kenta Ozeki
2022	J	`jnl`	Covering projective planar graphs with three forests. Discret. Math. Raiji Mukae, Kenta Ozeki, Terukazu Sano, Ryuji Tazume
2022	J	`jnl`	Kempe Equivalence Classes of Cubic Graphs Embedded on the Projective Plane. Comb. Kenta Ozeki
2022	A*	`conf`	Monotone edge flips to an orientation of maximum edge-connectivity à la Nash-Williams. SODA Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2022	B	`conf`	On Reachable Assignments Under Dichotomous Preferences. PRIMA Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2022	J	`jnl`	On Reachable Assignments under Dichotomous Preferences. CoRR Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2022	J	`jnl`	Reconfiguration of colorings in triangulations of the sphere. CoRR Takehiro Ito, Yuni Iwamasa, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2022	A*	`conf`	Reforming an Envy-Free Matching. AAAI Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2022	J	`jnl`	Reforming an Envy-Free Matching. CoRR Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2022	J	`jnl`	Rerouting Planar Curves and Disjoint Paths. CoRR Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2022	J	`jnl`	The Alon-Tarsi number of Discret. Math. Toshiki Abe, Seog-Jin Kim, Kenta Ozeki
2021	J	`jnl`	2-Factors of cubic bipartite graphs. Discret. Math. Nastaran Haghparast, Kenta Ozeki
2021	J	`jnl`	A Note on Enumeration of 3-Edge-Connected Spanning Subgraphs in Plane Graphs. IEICE Trans. Inf. Syst. Yasuko Matsui, Kenta Ozeki
2021	J	`jnl`	Monotone edge flips to an orientation of maximum edge-connectivity à la Nash-Williams. CoRR Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2021	J	`jnl`	Proper Colorings of Plane Quadrangulations Without Rainbow Faces. Graphs Comb. Kengo Enami, Kenta Ozeki, Tomoki Yamaguchi
2021	J	`jnl`	Single-conflict colouring. J. Graph Theory Zdenek Dvorák, Louis Esperet, Ross J. Kang, Kenta Ozeki
2020	J	`jnl`	A complete bipartite graph without properly colored cycles of length four. J. Graph Theory Roman Cada, Kenta Ozeki, Kiyoshi Yoshimoto
2020	J	`jnl`	Long Paths in Bipartite Graphs and Path-Bistar Bipartite Ramsey Numbers. Graphs Comb. Michitaka Furuya, Shun-ichi Maezawa, Kenta Ozeki
2020	J	`jnl`	On minimum leaf spanning trees and a criticality notion. Discret. Math. Kenta Ozeki, Gábor Wiener, Carol T. Zamfirescu
2020	J	`jnl`	Orientations of graphs avoiding given lists on out-degrees. J. Graph Theory Saieed Akbari, Mina Dalirrooyfard, K. Ehsani, Kenta Ozeki, R. Sherkati
2020	J	`jnl`	Thomassen's conjecture for line graphs of 3-hypergraphs. Discret. Math. Binlong Li, Kenta Ozeki, Zdenek Ryjácek, Petr Vrána
2019	J	`jnl`	A Degree Sum Condition on the Order, the Connectivity and the Independence Number for Hamiltonicity. Electron. J. Comb. Shuya Chiba, Michitaka Furuya, Kenta Ozeki, Masao Tsugaki, Tomoki Yamashita
2019	J	`jnl`	A note on a Brooks' type theorem for DP?coloring. J. Graph Theory Seog-Jin Kim, Kenta Ozeki
2019	J	`jnl`	Book Embedding of Graphs on the Projective Plane. SIAM J. Discret. Math. Kenta Ozeki, Atsuhiro Nakamoto, Takayuki Nozawa
2019	J	`jnl`	Connected odd factors of graphs. Australas. J Comb. Nastaran Haghparast, Mikio Kano, Shun-ichi Maezawa, Kenta Ozeki
2019	J	`jnl`	Extension to 3-Colorable Triangulations. SIAM J. Discret. Math. Atsuhiro Nakamoto, Kenta Noguchi, Kenta Ozeki
2019	J	`jnl`	Hamiltonicity of planar graphs with a forbidden minor. J. Graph Theory Mark N. Ellingham, Emily Abernethy Marshall, Kenta Ozeki, Shoichi Tsuchiya
2019	J	`jnl`	Highly edge-connected factors using given lists on degrees. J. Graph Theory Saieed Akbari, Morteza Hasanvand, Kenta Ozeki
2019	J	`jnl`	On the minimum leaf number of cubic graphs. Discret. Math. Jan Goedgebeur, Kenta Ozeki, Nico Van Cleemput, Gábor Wiener
2019	J	`jnl`	Spanning bipartite quadrangulations of even triangulations. J. Graph Theory Atsuhiro Nakamoto, Kenta Noguchi, Kenta Ozeki
2019	J	`jnl`	Types of triangle in Hamiltonian triangulations and an application to domination and Ars Math. Contemp. Gunnar Brinkmann, Kenta Ozeki, Nico Van Cleemput
2019	J	`jnl`	[a, b]-factors of graphs on surfaces. Discret. Math. Ryota Matsubara, Haruhide Matsuda, Nana Matsuo, Kenta Noguchi, Kenta Ozeki
2018	J	`jnl`	3-dynamic coloring of planar triangulations. Discret. Math. Yoshihiro Asayama, Yuki Kawasaki, Seog-Jin Kim, Atsuhiro Nakamoto, Kenta Ozeki
2018	J	`jnl`	A sufficient condition for DP-4-colorability. Discret. Math. Seog-Jin Kim, Kenta Ozeki
2018	J	`jnl`	Decomposing planar cubic graphs. J. Graph Theory Arthur Hoffmann-Ostenhof, Tomás Kaiser, Kenta Ozeki
2018	J	`jnl`	Every 4-Connected Graph with Crossing Number 2 is Hamiltonian. SIAM J. Discret. Math. Kenta Ozeki, Carol T. Zamfirescu
2018	J	`jnl`	Grünbaum colorings of even triangulations on surfaces. J. Graph Theory Michal Kotrbcík, Naoki Matsumoto, Bojan Mohar, Atsuhiro Nakamoto, Kenta Noguchi, Kenta Ozeki, Andrej Vodopivec
2018	J	`jnl`	Hamiltonian properties of polyhedra with few 3-cuts - A survey. Discret. Math. Kenta Ozeki, Nico Van Cleemput, Carol T. Zamfirescu
2018	—	`conf`	Hamiltonicity of Graphs on Surfaces in Terms of Toughness and Scattering Number - A Survey. JCDCGGG Kenta Ozeki
2018	J	`jnl`	Least conflict choosability. CoRR Zdenek Dvorák, Louis Esperet, Ross J. Kang, Kenta Ozeki
2018	J	`jnl`	Non-hamiltonian triangulations with distant separating triangles. Discret. Math. Kenta Ozeki, Carol T. Zamfirescu
2018	J	`jnl`	On homeomorphically irreducible spanning trees in cubic graphs. J. Graph Theory Arthur Hoffmann-Ostenhof, Kenta Noguchi, Kenta Ozeki
2018	J	`jnl`	On the minimum leaf number of cubic graphs. CoRR Jan Goedgebeur, Kenta Ozeki, Nico Van Cleemput, Gábor Wiener
2018	J	`jnl`	On upper bounds for the independent transversal domination number. Discret. Appl. Math. Christoph Brause, Michael A. Henning, Kenta Ozeki, Ingo Schiermeyer, Elkin Vumar
2018	J	`jnl`	Pairs of forbidden subgraphs and 2-connected supereulerian graphs. Discret. Math. Roman Cada, Kenta Ozeki, Liming Xiong, Kiyoshi Yoshimoto
2018	J	`jnl`	Sufficient conditions for the existence of a path-factor which are related to odd components. J. Graph Theory Yoshimi Egawa, Michitaka Furuya, Kenta Ozeki
2017	J	`jnl`	Coloring of locally planar graphs with one color class small. Australas. J Comb. Atsuhiro Nakamoto, Kenta Ozeki
2017	J	`jnl`	Matching Extension Missing Vertices and Edges in Triangulations of Surfaces. J. Graph Theory Ken-ichi Kawarabayashi, Kenta Ozeki, Michael D. Plummer
2017	J	`jnl`	On Dominating Even Subgraphs in Cubic Graphs. SIAM J. Discret. Math. Roman Cada, Shuya Chiba, Kenta Ozeki, Kiyoshi Yoshimoto
2017	J	`jnl`	On two conjectures about the proper connection number of graphs. Discret. Math. Fei Huang, Xueliang Li, Zhongmei Qin, Colton Magnant, Kenta Ozeki
2017	J	`jnl`	Plane Triangulations Without a Spanning Halin Subgraph II. SIAM J. Discret. Math. Guantao Chen, Hikoe Enomoto, Kenta Ozeki, Shoichi Tsuchiya
2016	J	`jnl`	5-Connected Toroidal Graphs are Hamiltonian-Connected. SIAM J. Discret. Math. Ken-ichi Kawarabayashi, Kenta Ozeki
2016	J	`jnl`	A Characterization of K SIAM J. Discret. Math. Mark N. Ellingham, Emily Abernethy Marshall, Kenta Ozeki, Shoichi Tsuchiya
2016	J	`jnl`	Cyclic 4-Colorings of Graphs on Surfaces. J. Graph Theory Atsuhiro Nakamoto, Kenta Noguchi, Kenta Ozeki
2016	J	`jnl`	Decomposing plane cubic graphs. Eur. J. Comb. Kenta Ozeki, Dong Ye
2016	J	`jnl`	Vertex Coloring of Graphs by Total 2-Weightings. Graphs Comb. Jonathan Hulgan, Jeno Lehel, Kenta Ozeki, Kiyoshi Yoshimoto
2016	J	`jnl`	m-dominating k-trees of graphs. Discret. Math. Mikio Kano, Kenta Ozeki, Masao Tsugaki, Guiying Yan
2015	J	`jnl`	2-factors with bounded number of components in claw-free graphs. Discret. Math. Kenta Ozeki, Zdenek Ryjácek, Kiyoshi Yoshimoto
2015	J	`jnl`	4-connected projective-planar graphs are Hamiltonian-connected. J. Comb. Theory B Ken-ichi Kawarabayashi, Kenta Ozeki
2015	J	`jnl`	A Relationship Between Thomassen's Conjecture and Bondy's Conjecture. SIAM J. Discret. Math. Roman Cada, Shuya Chiba, Kenta Ozeki, Petr Vrána, Kiyoshi Yoshimoto
2015	J	`jnl`	A Toughness Condition for a Spanning Tree With Bounded Total Excesses. Graphs Comb. Kenta Ozeki
2015	J	`jnl`	Equivalence of Jackson's and Thomassen's conjectures. J. Comb. Theory B Roman Cada, Shuya Chiba, Kenta Ozeki, Petr Vrána, Kiyoshi Yoshimoto
2015	J	`jnl`	Extension to Even Triangulations. SIAM J. Discret. Math. Atsuhiro Nakamoto, Kenta Noguchi, Kenta Ozeki
2015	J	`jnl`	Plane Triangulations Without a Spanning Halin Subgraph: Counterexamples to the Lovász-Plummer Conjecture on Halin Graphs. SIAM J. Discret. Math. Guantao Chen, Hikoe Enomoto, Kenta Ozeki, Shoichi Tsuchiya
2015	J	`jnl`	Spanning $k$-trees of Bipartite Graphs. Electron. J. Comb. Mikio Kano, Kenta Ozeki, Kazuhiro Suzuki, Masao Tsugaki, Tomoki Yamashita
2015	J	`jnl`	Spanning Trees with Vertices Having Large Degrees. J. Graph Theory Yoshimi Egawa, Kenta Ozeki
2015	J	`jnl`	Spanning k-Forests with Large Components in K Graphs Comb. Kenta Ozeki, Takeshi Sugiyama
2015	J	`jnl`	The Chromatic Index of a Claw-Free Graph Whose Core has Maximum Degree 2. Graphs Comb. Saieed Akbari, Maryam Ghanbari, Kenta Ozeki
2015	J	`jnl`	The Existence of Semi-colorings in a Graph. Graphs Comb. Michitaka Furuya, Masaru Kamada, Kenta Ozeki
2015	J	`jnl`	{0, 2}-Degree free spanning forests in graphs. Discret. Math. Saieed Akbari, Kenta Ozeki, Alireza Rezaei, Rahmtin Rotabi, Sara Sabour
2014	J	`jnl`	2-edge-Hamiltonian-connectedness of 4-connected plane graphs. Eur. J. Comb. Kenta Ozeki, Petr Vrána
2014	J	`jnl`	A necessary and sufficient condition for the existence of a spanning tree with specified vertices having large degrees. Comb. Yoshimi Egawa, Kenta Ozeki
2014	J	`jnl`	Improved Upper Bounds for Gallai-Ramsey Numbers of Paths and Cycles. J. Graph Theory Martin Hall, Colton Magnant, Kenta Ozeki, Masao Tsugaki
2014	J	`jnl`	On the ratio of the domination number and the independent domination number in graphs. Discret. Appl. Math. Michitaka Furuya, Kenta Ozeki, Akinari Sasaki
2014	J	`jnl`	Spanning Trees with a Bounded Number of Branch Vertices in a Claw-Free Graph. Graphs Comb. Haruhide Matsuda, Kenta Ozeki, Tomoki Yamashita
2014	J	`jnl`	Spanning closed walks and TSP in 3-connected planar graphs. J. Comb. Theory B Ken-ichi Kawarabayashi, Kenta Ozeki
2013	J	`jnl`	4, 5 Is Not Coverable: A Counterexample to a Conjecture of Kaiser and Škrekovski. SIAM J. Discret. Math. Roman Cada, Shuya Chiba, Kenta Ozeki, Petr Vrána, Kiyoshi Yoshimoto
2013	A*	`conf`	4-connected projective-planar graphs are hamiltonian-connected. SODA Ken-ichi Kawarabayashi, Kenta Ozeki
2013	J	`jnl`	A simpler proof for the two disjoint odd cycles theorem. J. Comb. Theory B Ken-ichi Kawarabayashi, Kenta Ozeki
2013	J	`jnl`	Forbidden Subgraphs Generating Almost the Same Sets. Comb. Probab. Comput. Shinya Fujita, Michitaka Furuya, Kenta Ozeki
2013	J	`jnl`	Forbidden induced subgraphs for near perfect matchings. Discret. Math. Katsuhiro Ota, Kenta Ozeki, Gabriel Sueiro
2013	J	`jnl`	Hamiltonian cycles in bipartite toroidal graphs with a partite set of degree four vertices. J. Comb. Theory B Jun Fujisawa, Atsuhiro Nakamoto, Kenta Ozeki
2013	J	`jnl`	Spanning Trees with Bounded Maximum Degrees of Graphs on Surfaces. SIAM J. Discret. Math. Kenta Ozeki
2012	J	`jnl`	2-factors and independent sets on claw-free graphs. Discret. Math. Roman Kuzel, Kenta Ozeki, Kiyoshi Yoshimoto
2012	J	`jnl`	Book Embedding of Toroidal Bipartite Graphs. SIAM J. Discret. Math. Atsuhiro Nakamoto, Katsuhiro Ota, Kenta Ozeki
2012	J	`jnl`	Claw-free graphs and 2-factors that separate independent vertices. J. Graph Theory Ralph J. Faudree, Colton Magnant, Kenta Ozeki, Kiyoshi Yoshimoto
2012	J	`jnl`	Hamiltonian cycles in bipartite quadrangulations on the torus. J. Graph Theory Atsuhiro Nakamoto, Kenta Ozeki
2012	J	`jnl`	Length of Longest Cycles in a Graph Whose Relative Length is at Least Two. Graphs Comb. Kenta Ozeki, Tomoki Yamashita
2012	A*	`conf`	Spanning closed walks and TSP in 3-connected planar graphs. SODA Ken-ichi Kawarabayashi, Kenta Ozeki
2012	J	`jnl`	Spanning trees in 3-connected K J. Comb. Theory B Katsuhiro Ota, Kenta Ozeki
2012	J	`jnl`	Spanning trees with a bounded number of leaves in a claw-free graph. Ars Comb. Mikio Kano, Aung Kyaw, Haruhide Matsuda, Kenta Ozeki, Akira Saito, Tomoki Yamashita
2011	J	`jnl`	2- and 3-factors of graphs on surfaces. J. Graph Theory Ken-ichi Kawarabayashi, Kenta Ozeki
2011	J	`jnl`	Dominating cycles in triangle-free graphs. Ars Comb. Kenta Ozeki, Tomoki Yamashita
2011	J	`jnl`	Forbidden induced subgraphs for star-free graphs. Discret. Math. Jun Fujisawa, Katsuhiro Ota, Kenta Ozeki, Gabriel Sueiro
2011	J	`jnl`	Hamilton cycles in 4-connected troidal triangulations. Electron. Notes Discret. Math. Ken-ichi Kawarabayashi, Kenta Ozeki
2011	J	`jnl`	Non-separating subgraphs after deleting many disjoint paths. J. Comb. Theory B Ken-ichi Kawarabayashi, Kenta Ozeki
2011	J	`jnl`	Spanning Trees: A Survey. Graphs Comb. Kenta Ozeki, Tomoki Yamashita
2010	J	`jnl`	4-connected triangulations and 4-orderedness. Discret. Math. Raiji Mukae, Kenta Ozeki
2010	J	`jnl`	A Graphs Comb. Shuya Chiba, Ryota Matsubara, Kenta Ozeki, Masao Tsugaki
2010	J	`jnl`	A Spanning Tree with High Degree Vertices. Graphs Comb. Kenta Ozeki, Tomoki Yamashita
2010	J	`jnl`	A simple algorithm for 4-coloring 3-colorable planar graphs. Theor. Comput. Sci. Ken-ichi Kawarabayashi, Kenta Ozeki
2010	J	`jnl`	Rainbow Generalizations of Ramsey Theory: A Survey. Graphs Comb. Shinya Fujita, Colton Magnant, Kenta Ozeki
2010	J	`jnl`	Set-orderedness as a generalization of k-orderedness and cyclability. Discret. Math. Keishi Ishii, Kenta Ozeki, Kiyoshi Yoshimoto
2010	J	`jnl`	The independence number condition for the existence of a spanning J. Graph Theory Hikoe Enomoto, Kenta Ozeki
2009	J	`jnl`	A degree sum condition for graphs to be prism hamiltonian. Discret. Math. Kenta Ozeki
2009	J	`jnl`	Hamiltonian cycles and dominating cycles passing through a linear forest. Discret. Math. Kenta Ozeki, Tomoki Yamashita
2009	J	`jnl`	On relative length of longest paths and cycles. J. Graph Theory Kenta Ozeki, Masao Tsugaki, Tomoki Yamashita
2009	J	`jnl`	Spanning trees in 3-connected K Electron. Notes Discret. Math. Katsuhiro Ota, Kenta Ozeki
2008	J	`jnl`	A Degree Sum Condition Concerning the Connectivity and the Independence Number of a Graph. Graphs Comb. Kenta Ozeki, Tomoki Yamashita
2008	J	`jnl`	Long cycles in graphs without hamiltonian paths. Discret. Math. Ken-ichi Kawarabayashi, Kenta Ozeki, Tomoki Yamashita