default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKenta Ozeki
Person information
Other persons with a similar name
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j106]Atsuhiro Nakamoto, Kenta Ozeki, Daiki Takahashi:
2-Connected spanning subgraphs of circuit graphs. Discret. Math. 348(1): 114228 (2025)- 2024
- [j105]Analen Malnegro
, Kenta Ozeki:
H-colorings for 4-regular graphs. Discret. Math. 347(3): 113844 (2024) - [j104]Yoshimi Egawa, Kenjiro Ogawa, Kenta Ozeki, Satoshi Tagusari, Morimasa Tsuchiya:
On strict-double-bound graphs and Cartesian products of paths and cycles. Discret. Math. Algorithms Appl. 16(5): 2350058:1-2350058:6 (2024) - [i9]Pjotr Buys, Ross J. Kang, Kenta Ozeki:
Reconfiguration of Independent Transversals. CoRR abs/2407.04367 (2024) - 2023
- [j103]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) - [j102]Michitaka Furuya, Naoki Matsumoto, Yumiko Ohno, Kenta Ozeki:
Note on fair game edge-connectivity of graphs. Discret. Appl. Math. 333: 132-135 (2023) - [j101]Seungjae Eom, Kenta Ozeki:
A 2-Bisection with Small Number of Monochromatic Edges of a Claw-Free Cubic Graph. Graphs Comb. 39(1): 17 (2023) - [j100]Yaping Mao, Kenta Ozeki, Aaron Robertson, Zhao Wang:
Arithmetic progressions, quasi progressions, and Gallai-Ramsey colorings. J. Comb. Theory A 193: 105672 (2023) - [j99]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): 6:1-6:22 (2023) - [j98]Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki:
On reachable assignments under dichotomous preferences. Theor. Comput. Sci. 979: 114196 (2023) - [c8]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: 43:1-43:16 - [c7]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: 81:1-81:19 - [i8]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 abs/2311.09042 (2023) - 2022
- [j97]Kenta Ozeki:
Kempe Equivalence Classes of Cubic Graphs Embedded on the Projective Plane. Comb. 42(Supplement 2): 1451-1480 (2022) - [j96]Raiji Mukae, Kenta Ozeki, Terukazu Sano, Ryuji Tazume:
Covering projective planar graphs with three forests. Discret. Math. 345(4): 112748 (2022) - [j95]Toshiki Abe, Seog-Jin Kim, Kenta Ozeki:
The Alon-Tarsi number of K5-minor-free graphs. Discret. Math. 345(4): 112764 (2022) - [j94]Shun-ichi Maezawa, Kenta Ozeki:
A forbidden pair for connected graphs to have spanning k-trees. J. Graph Theory 99(3): 509-519 (2022) - [c6]Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki:
Reforming an Envy-Free Matching. AAAI 2022: 5084-5091 - [c5]Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki:
On Reachable Assignments Under Dichotomous Preferences. PRIMA 2022: 650-658 - [c4]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: 1342-1355 - [i7]Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki:
Reforming an Envy-Free Matching. CoRR abs/2207.02641 (2022) - [i6]Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki:
On Reachable Assignments under Dichotomous Preferences. CoRR abs/2209.10262 (2022) - [i5]Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki:
Rerouting Planar Curves and Disjoint Paths. CoRR abs/2210.11778 (2022) - [i4]Takehiro Ito, Yuni Iwamasa, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki:
Reconfiguration of colorings in triangulations of the sphere. CoRR abs/2210.17105 (2022) - 2021
- [j93]Nastaran Haghparast, Kenta Ozeki:
2-Factors of cubic bipartite graphs. Discret. Math. 344(7): 112357 (2021) - [j92]Kengo Enami, Kenta Ozeki, Tomoki Yamaguchi:
Proper Colorings of Plane Quadrangulations Without Rainbow Faces. Graphs Comb. 37(5): 1873-1890 (2021) - [j91]Yasuko Matsui, Kenta Ozeki:
A Note on Enumeration of 3-Edge-Connected Spanning Subgraphs in Plane Graphs. IEICE Trans. Inf. Syst. 104-D(3): 389-391 (2021) - [j90]Zdenek Dvorák, Louis Esperet, Ross J. Kang, Kenta Ozeki:
Single-conflict colouring. J. Graph Theory 97(1): 148-160 (2021) - [i3]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 abs/2110.11585 (2021) - 2020
- [j89]Binlong Li, Kenta Ozeki, Zdenek Ryjácek, Petr Vrána:
Thomassen's conjecture for line graphs of 3-hypergraphs. Discret. Math. 343(6): 111838 (2020) - [j88]Kenta Ozeki, Gábor Wiener, Carol T. Zamfirescu:
On minimum leaf spanning trees and a criticality notion. Discret. Math. 343(7): 111884 (2020) - [j87]Michitaka Furuya, Shun-ichi Maezawa, Kenta Ozeki:
Long Paths in Bipartite Graphs and Path-Bistar Bipartite Ramsey Numbers. Graphs Comb. 36(1): 167-176 (2020) - [j86]Roman Cada, Kenta Ozeki, Kiyoshi Yoshimoto:
A complete bipartite graph without properly colored cycles of length four. J. Graph Theory 93(2): 168-180 (2020) - [j85]Saieed Akbari, Mina Dalirrooyfard, K. Ehsani, Kenta Ozeki, R. Sherkati:
Orientations of graphs avoiding given lists on out-degrees. J. Graph Theory 93(4): 483-502 (2020)
2010 – 2019
- 2019
- [j84]Nastaran Haghparast, Mikio Kano, Shun-ichi Maezawa, Kenta Ozeki:
Connected odd factors of graphs. Australas. J Comb. 73: 200-206 (2019) - [j83]Gunnar Brinkmann, Kenta Ozeki, Nico Van Cleemput:
Types of triangle in Hamiltonian triangulations and an application to domination and k-walks. Ars Math. Contemp. 17(1): 51-66 (2019) - [j82]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): 4 (2019) - [j81]Ryota Matsubara, Haruhide Matsuda, Nana Matsuo, Kenta Noguchi, Kenta Ozeki:
[a, b]-factors of graphs on surfaces. Discret. Math. 342(7): 1979-1988 (2019) - [j80]Jan Goedgebeur, Kenta Ozeki, Nico Van Cleemput, Gábor Wiener:
On the minimum leaf number of cubic graphs. Discret. Math. 342(11): 3000-3005 (2019) - [j79]Saieed Akbari, Morteza Hasanvand, Kenta Ozeki:
Highly edge-connected factors using given lists on degrees. J. Graph Theory 90(2): 150-159 (2019) - [j78]Atsuhiro Nakamoto, Kenta Noguchi, Kenta Ozeki:
Spanning bipartite quadrangulations of even triangulations. J. Graph Theory 90(3): 267-287 (2019) - [j77]Mark N. Ellingham, Emily Abernethy Marshall, Kenta Ozeki, Shoichi Tsuchiya:
Hamiltonicity of planar graphs with a forbidden minor. J. Graph Theory 90(4): 459-483 (2019) - [j76]Seog-Jin Kim, Kenta Ozeki:
A note on a Brooks' type theorem for DP?coloring. J. Graph Theory 91(2): 148-161 (2019) - [j75]Atsuhiro Nakamoto, Kenta Noguchi, Kenta Ozeki:
Extension to 3-Colorable Triangulations. SIAM J. Discret. Math. 33(3): 1390-1414 (2019) - [j74]Kenta Ozeki, Atsuhiro Nakamoto, Takayuki Nozawa:
Book Embedding of Graphs on the Projective Plane. SIAM J. Discret. Math. 33(4): 1801-1836 (2019) - 2018
- [j73]Christoph Brause, Michael A. Henning, Kenta Ozeki, Ingo Schiermeyer, Elkin Vumar:
On upper bounds for the independent transversal domination number. Discret. Appl. Math. 236: 66-72 (2018) - [j72]Roman Cada, Kenta Ozeki, Liming Xiong, Kiyoshi Yoshimoto:
Pairs of forbidden subgraphs and 2-connected supereulerian graphs. Discret. Math. 341(6): 1696-1707 (2018) - [j71]Kenta Ozeki, Carol T. Zamfirescu:
Non-hamiltonian triangulations with distant separating triangles. Discret. Math. 341(7): 1900-1902 (2018) - [j70]Seog-Jin Kim, Kenta Ozeki:
A sufficient condition for DP-4-colorability. Discret. Math. 341(7): 1983-1986 (2018) - [j69]Kenta Ozeki, Nico Van Cleemput, Carol T. Zamfirescu:
Hamiltonian properties of polyhedra with few 3-cuts - A survey. Discret. Math. 341(9): 2646-2660 (2018) - [j68]Yoshihiro Asayama, Yuki Kawasaki, Seog-Jin Kim, Atsuhiro Nakamoto, Kenta Ozeki:
3-dynamic coloring of planar triangulations. Discret. Math. 341(11): 2988-2994 (2018) - [j67]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): 475-491 (2018) - [j66]Arthur Hoffmann-Ostenhof, Tomás Kaiser, Kenta Ozeki:
Decomposing planar cubic graphs. J. Graph Theory 88(4): 631-640 (2018) - [j65]Arthur Hoffmann-Ostenhof, Kenta Noguchi, Kenta Ozeki:
On homeomorphically irreducible spanning trees in cubic graphs. J. Graph Theory 89(2): 93-100 (2018) - [j64]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): 327-340 (2018) - [j63]Kenta Ozeki, Carol T. Zamfirescu:
Every 4-Connected Graph with Crossing Number 2 is Hamiltonian. SIAM J. Discret. Math. 32(4): 2783-2794 (2018) - [c3]Kenta Ozeki:
Hamiltonicity of Graphs on Surfaces in Terms of Toughness and Scattering Number - A Survey. JCDCGGG 2018: 74-95 - [i2]Zdenek Dvorák, Louis Esperet, Ross J. Kang, Kenta Ozeki:
Least conflict choosability. CoRR abs/1803.10962 (2018) - [i1]Jan Goedgebeur, Kenta Ozeki, Nico Van Cleemput, Gábor Wiener:
On the minimum leaf number of cubic graphs. CoRR abs/1806.04451 (2018) - 2017
- [j62]Atsuhiro Nakamoto, Kenta Ozeki:
Coloring of locally planar graphs with one color class small. Australas. J Comb. 67: 101-118 (2017) - [j61]Fei Huang, Xueliang Li, Zhongmei Qin, Colton Magnant, Kenta Ozeki:
On two conjectures about the proper connection number of graphs. Discret. Math. 340(9): 2217-2222 (2017) - [j60]Ken-ichi Kawarabayashi, Kenta Ozeki, Michael D. Plummer:
Matching Extension Missing Vertices and Edges in Triangulations of Surfaces. J. Graph Theory 85(1): 249-257 (2017) - [j59]Roman Cada, Shuya Chiba, Kenta Ozeki, Kiyoshi Yoshimoto:
On Dominating Even Subgraphs in Cubic Graphs. SIAM J. Discret. Math. 31(2): 890-907 (2017) - [j58]Guantao Chen, Hikoe Enomoto, Kenta Ozeki, Shoichi Tsuchiya:
Plane Triangulations Without a Spanning Halin Subgraph II. SIAM J. Discret. Math. 31(4): 2429-2439 (2017) - 2016
- [j57]Mikio Kano, Kenta Ozeki, Masao Tsugaki, Guiying Yan:
m-dominating k-trees of graphs. Discret. Math. 339(2): 729-736 (2016) - [j56]Kenta Ozeki, Dong Ye:
Decomposing plane cubic graphs. Eur. J. Comb. 52: 40-46 (2016) - [j55]Jonathan Hulgan, Jeno Lehel, Kenta Ozeki, Kiyoshi Yoshimoto:
Vertex Coloring of Graphs by Total 2-Weightings. Graphs Comb. 32(6): 2461-2471 (2016) - [j54]Atsuhiro Nakamoto, Kenta Noguchi, Kenta Ozeki:
Cyclic 4-Colorings of Graphs on Surfaces. J. Graph Theory 82(3): 265-278 (2016) - [j53]Ken-ichi Kawarabayashi, Kenta Ozeki:
5-Connected Toroidal Graphs are Hamiltonian-Connected. SIAM J. Discret. Math. 30(1): 112-140 (2016) - [j52]Mark N. Ellingham, Emily Abernethy Marshall, Kenta Ozeki, Shoichi Tsuchiya:
A Characterization of K2, 4-Minor-Free Graphs. SIAM J. Discret. Math. 30(2): 955-975 (2016) - 2015
- [j51]Mikio Kano, Kenta Ozeki, Kazuhiro Suzuki, Masao Tsugaki, Tomoki Yamashita:
Spanning $k$-trees of Bipartite Graphs. Electron. J. Comb. 22(1): 1 (2015) - [j50]Kenta Ozeki, Zdenek Ryjácek, Kiyoshi Yoshimoto:
2-factors with bounded number of components in claw-free graphs. Discret. Math. 338(5): 793-808 (2015) - [j49]Saieed Akbari, Kenta Ozeki, Alireza Rezaei, Rahmtin Rotabi, Sara Sabour:
{0, 2}-Degree free spanning forests in graphs. Discret. Math. 338(7): 1226-1231 (2015) - [j48]Saieed Akbari, Maryam Ghanbari, Kenta Ozeki:
The Chromatic Index of a Claw-Free Graph Whose Core has Maximum Degree 2. Graphs Comb. 31(4): 805-811 (2015) - [j47]Michitaka Furuya, Masaru Kamada, Kenta Ozeki:
The Existence of Semi-colorings in a Graph. Graphs Comb. 31(5): 1397-1401 (2015) - [j46]Kenta Ozeki, Takeshi Sugiyama:
Spanning k-Forests with Large Components in K1, k+1-Free Graphs. Graphs Comb. 31(5): 1659-1677 (2015) - [j45]Kenta Ozeki:
A Toughness Condition for a Spanning Tree With Bounded Total Excesses. Graphs Comb. 31(5): 1679-1688 (2015) - [j44]Ken-ichi Kawarabayashi, Kenta Ozeki:
4-connected projective-planar graphs are Hamiltonian-connected. J. Comb. Theory B 112: 36-69 (2015) - [j43]Roman Cada, Shuya Chiba, Kenta Ozeki, Petr Vrána, Kiyoshi Yoshimoto:
Equivalence of Jackson's and Thomassen's conjectures. J. Comb. Theory B 114: 124-147 (2015) - [j42]Yoshimi Egawa, Kenta Ozeki:
Spanning Trees with Vertices Having Large Degrees. J. Graph Theory 79(3): 213-221 (2015) - [j41]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): 26-35 (2015) - [j40]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): 1423-1426 (2015) - [j39]Atsuhiro Nakamoto, Kenta Noguchi, Kenta Ozeki:
Extension to Even Triangulations. SIAM J. Discret. Math. 29(4): 2075-2087 (2015) - 2014
- [j38]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): 47-60 (2014) - [j37]Michitaka Furuya, Kenta Ozeki, Akinari Sasaki:
On the ratio of the domination number and the independent domination number in graphs. Discret. Appl. Math. 178: 157-159 (2014) - [j36]Kenta Ozeki, Petr Vrána:
2-edge-Hamiltonian-connectedness of 4-connected plane graphs. Eur. J. Comb. 35: 432-448 (2014) - [j35]Haruhide Matsuda, Kenta Ozeki, Tomoki Yamashita:
Spanning Trees with a Bounded Number of Branch Vertices in a Claw-Free Graph. Graphs Comb. 30(2): 429-437 (2014) - [j34]Ken-ichi Kawarabayashi, Kenta Ozeki:
Spanning closed walks and TSP in 3-connected planar graphs. J. Comb. Theory B 109: 1-33 (2014) - [j33]Martin Hall, Colton Magnant, Kenta Ozeki, Masao Tsugaki:
Improved Upper Bounds for Gallai-Ramsey Numbers of Paths and Cycles. J. Graph Theory 75(1): 59-74 (2014) - 2013
- [j32]Shinya Fujita, Michitaka Furuya, Kenta Ozeki:
Forbidden Subgraphs Generating Almost the Same Sets. Comb. Probab. Comput. 22(5): 733-748 (2013) - [j31]Katsuhiro Ota, Kenta Ozeki, Gabriel Sueiro:
Forbidden induced subgraphs for near perfect matchings. Discret. Math. 313(11): 1267-1280 (2013) - [j30]Jun Fujisawa, Atsuhiro Nakamoto, Kenta Ozeki:
Hamiltonian cycles in bipartite toroidal graphs with a partite set of degree four vertices. J. Comb. Theory B 103(1): 46-60 (2013) - [j29]Ken-ichi Kawarabayashi, Kenta Ozeki:
A simpler proof for the two disjoint odd cycles theorem. J. Comb. Theory B 103(3): 313-319 (2013) - [j28]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): 141-144 (2013) - [j27]Kenta Ozeki:
Spanning Trees with Bounded Maximum Degrees of Graphs on Surfaces. SIAM J. Discret. Math. 27(1): 422-435 (2013) - [c2]Ken-ichi Kawarabayashi, Kenta Ozeki:
4-connected projective-planar graphs are hamiltonian-connected. SODA 2013: 378-395 - 2012
- [j26]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: 137-154 (2012) - [j25]Roman Kuzel, Kenta Ozeki, Kiyoshi Yoshimoto:
2-factors and independent sets on claw-free graphs. Discret. Math. 312(2): 202-206 (2012) - [j24]Kenta Ozeki, Tomoki Yamashita:
Length of Longest Cycles in a Graph Whose Relative Length is at Least Two. Graphs Comb. 28(6): 859-868 (2012) - [j23]Katsuhiro Ota, Kenta Ozeki:
Spanning trees in 3-connected K3, t-minor-free graphs. J. Comb. Theory B 102(5): 1179-1188 (2012) - [j22]Atsuhiro Nakamoto, Kenta Ozeki:
Hamiltonian cycles in bipartite quadrangulations on the torus. J. Graph Theory 69(2): 143-151 (2012) - [j21]Ralph J. Faudree, Colton Magnant, Kenta Ozeki, Kiyoshi Yoshimoto:
Claw-free graphs and 2-factors that separate independent vertices. J. Graph Theory 69(3): 251-263 (2012) - [j20]Atsuhiro Nakamoto, Katsuhiro Ota, Kenta Ozeki:
Book Embedding of Toroidal Bipartite Graphs. SIAM J. Discret. Math. 26(2): 661-669 (2012) - [c1]Ken-ichi Kawarabayashi, Kenta Ozeki:
Spanning closed walks and TSP in 3-connected planar graphs. SODA 2012: 671-682 - 2011
- [j19]Kenta Ozeki, Tomoki Yamashita:
Dominating cycles in triangle-free graphs. Ars Comb. 98: 173-182 (2011) - [j18]Jun Fujisawa, Katsuhiro Ota, Kenta Ozeki, Gabriel Sueiro:
Forbidden induced subgraphs for star-free graphs. Discret. Math. 311(21): 2475-2484 (2011) - [j17]Ken-ichi Kawarabayashi, Kenta Ozeki:
Hamilton cycles in 4-connected troidal triangulations. Electron. Notes Discret. Math. 38: 493-498 (2011) - [j16]Kenta Ozeki, Tomoki Yamashita:
Spanning Trees: A Survey. Graphs Comb. 27(1): 1-26 (2011) - [j15]Ken-ichi Kawarabayashi, Kenta Ozeki:
Non-separating subgraphs after deleting many disjoint paths. J. Comb. Theory B 101(1): 54-59 (2011) - [j14]Ken-ichi Kawarabayashi, Kenta Ozeki:
2- and 3-factors of graphs on surfaces. J. Graph Theory 67(4): 306-315 (2011) - 2010
- [j13]Raiji Mukae, Kenta Ozeki:
4-connected triangulations and 4-orderedness. Discret. Math. 310(17-18): 2271-2272 (2010) - [j12]Keishi Ishii, Kenta Ozeki, Kiyoshi Yoshimoto:
Set-orderedness as a generalization of k-orderedness and cyclability. Discret. Math. 310(17-18): 2310-2316 (2010) - [j11]Shinya Fujita, Colton Magnant, Kenta Ozeki:
Rainbow Generalizations of Ramsey Theory: A Survey. Graphs Comb. 26(1): 1-30 (2010) - [j10]Shuya Chiba, Ryota Matsubara, Kenta Ozeki, Masao Tsugaki:
A k-Tree Containing Specified Vertices. Graphs Comb. 26(2): 187-205 (2010) - [j9]Kenta Ozeki, Tomoki Yamashita:
A Spanning Tree with High Degree Vertices. Graphs Comb. 26(4): 591-596 (2010) - [j8]Hikoe Enomoto, Kenta Ozeki:
The independence number condition for the existence of a spanning f-tree. J. Graph Theory 65(3): 173-184 (2010) - [j7]Ken-ichi Kawarabayashi, Kenta Ozeki:
A simple algorithm for 4-coloring 3-colorable planar graphs. Theor. Comput. Sci. 411(26-28): 2619-2622 (2010)
2000 – 2009
- 2009
- [j6]Kenta Ozeki, Tomoki Yamashita:
Hamiltonian cycles and dominating cycles passing through a linear forest. Discret. Math. 309(6): 1584-1592 (2009) - [j5]Kenta Ozeki:
A degree sum condition for graphs to be prism hamiltonian. Discret. Math. 309(13): 4266-4269 (2009) - [j4]Katsuhiro Ota, Kenta Ozeki:
Spanning trees in 3-connected K3, t-minor-free graphs. Electron. Notes Discret. Math. 34: 145-149 (2009) - [j3]Kenta Ozeki, Masao Tsugaki, Tomoki Yamashita:
On relative length of longest paths and cycles. J. Graph Theory 62(3): 279-291 (2009) - 2008
- [j2]Ken-ichi Kawarabayashi, Kenta Ozeki, Tomoki Yamashita:
Long cycles in graphs without hamiltonian paths. Discret. Math. 308(24): 5899-5906 (2008) - [j1]Kenta Ozeki, Tomoki Yamashita:
A Degree Sum Condition Concerning the Connectivity and the Independence Number of a Graph. Graphs Comb. 24(5): 469-483 (2008)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-21 23:41 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
