Reforming an Envy-Free Matching - Takehiro Ito; Yuni Iwamasa; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi; Yuta Nozaki; Yoshio Okamoto; Kenta Ozeki (Algorithmica, 2025)

2-Connected spanning subgraphs of circuit graphs - Atsuhiro Nakamoto; Kenta Ozeki; Daiki Takahashi (Discret. Math., 2025)

A spanning tree with at most k leaves in a K1,5-free graph - Pei Sun; Yuan Chen; Masahiro Kimura; Kenta Ozeki; Masao Tsugaki (Discret. Math., 2025)

An odd 4-coloring of a maximal outerplanar graph - Masaki Kashima; Shun-ichi Maezawa; Kakeru Osako; Kenta Ozeki; Shoichi Tsuchiya (Discret. Math., 2025)

Coloring zonotopal quadrangulations of the projective space - Masahiro Hachimori; Atsuhiro Nakamoto; Kenta Ozeki (Eur. J. Comb., 2025)

Rerouting Planar Curves and Disjoint Paths - Takehiro Ito; Yuni Iwamasa; Naonori Kakimura; Yusuke Kobayashi; Shun-ichi Maezawa; Yuta Nozaki; Yoshio Okamoto; Kenta Ozeki (ACM Trans. Algorithms, 2025)

H-colorings for 4-regular graphs - Analen Malnegro; Kenta Ozeki (Discret. Math., 2024)

On strict-double-bound graphs and Cartesian products of paths and cycles - Yoshimi Egawa; Kenjiro Ogawa; Kenta Ozeki; Satoshi Tagusari; Morimasa Tsuchiya (Discret. Math. Algorithms Appl., 2024)

Reconfiguration of Independent Transversals - Pjotr Buys; Ross J. Kang; Kenta Ozeki (CoRR, 2024)

A Spanning Tree with at Most k Leaves in a K_{1,p}-Free Graph - Kenta Ozeki; Masao Tsugaki (Electron. J. Comb., 2023)

Note on fair game edge-connectivity of graphs - Michitaka Furuya; Naoki Matsumoto; Yumiko Ohno; Kenta Ozeki (Discret. Appl. Math., 2023)

A 2-Bisection with Small Number of Monochromatic Edges of a Claw-Free Cubic Graph - Seungjae Eom; Kenta Ozeki (Graphs Comb., 2023)

Arithmetic progressions, quasi progressions, and Gallai-Ramsey colorings - Yaping Mao; Kenta Ozeki; Aaron Robertson; Zhao Wang (J. Comb. Theory A, 2023)

Monotone Edge Flips to an Orientation of Maximum Edge-Connectivity à la Nash-Williams - Takehiro Ito; Yuni Iwamasa; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi; Shun-ichi Maezawa; Yuta Nozaki; Yoshio Okamoto; Kenta Ozeki (ACM Trans. Algorithms, 2023)

On reachable assignments under dichotomous preferences - Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi; Yuta Nozaki; Yoshio Okamoto; Kenta Ozeki (Theor. Comput. Sci., 2023)

Reconfiguration of Colorings in Triangulations of the Sphere - Takehiro Ito; Yuni Iwamasa; Yusuke Kobayashi; Shun-ichi Maezawa; Yuta Nozaki; Yoshio Okamoto; Kenta Ozeki (39th International Symposium on Computational Geometry, SoCG 2023, June 12-15, 2023, Dallas, Texas, USA, 2023)

Rerouting Planar Curves and Disjoint Paths - Takehiro Ito; Yuni Iwamasa; Naonori Kakimura; Yusuke Kobayashi; Shun-ichi Maezawa; Yuta Nozaki; Yoshio Okamoto; Kenta Ozeki (50th International Colloquium on Automata, Languages, and Programming, ICALP 2023, July 10-14, 2023, Paderborn, Germany, 2023)

A necessary and sufficient condition for the existence of a properly coloured f-factor in an edge-coloured graph - Roman Cada; Michitaka Furuya; Kenji Kimura; Kenta Ozeki; Christopher Purcell; Takamasa Yashima (CoRR, 2023)

Kempe Equivalence Classes of Cubic Graphs Embedded on the Projective Plane - Kenta Ozeki (Comb., 2022)

Covering projective planar graphs with three forests - Raiji Mukae; Kenta Ozeki; Terukazu Sano; Ryuji Tazume (Discret. Math., 2022)

The Alon-Tarsi number of K\(_5\)-minor-free graphs - Toshiki Abe; Seog-Jin Kim; Kenta Ozeki (Discret. Math., 2022)

A forbidden pair for connected graphs to have spanning k-trees - Shun-ichi Maezawa; Kenta Ozeki (J. Graph Theory, 2022)

Reforming an Envy-Free Matching - Takehiro Ito; Yuni Iwamasa; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi; Yuta Nozaki; Yoshio Okamoto; Kenta Ozeki (Thirty-Sixth AAAI Conference on Artificial Intelligence, AAAI 2022, Thirty-Fourth Conference on Innovative Applications of Artificial Intelligence, IAAI 2022, The Twelveth Symposium on Educational Advances in Artificial Intelligence, EAAI 2022 Virtual Event, February 22 - March 1, 2022, 2022)

On Reachable Assignments Under Dichotomous Preferences - Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi; Yuta Nozaki; Yoshio Okamoto; Kenta Ozeki (PRIMA 2022: Principles and Practice of Multi-Agent Systems - 24th International Conference, Valencia, Spain, November 16-18, 2022, Proceedings, 2022)

Monotone edge flips to an orientation of maximum edge-connectivity à la Nash-Williams - Takehiro Ito; Yuni Iwamasa; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi; Shun-ichi Maezawa; Yuta Nozaki; Yoshio Okamoto; Kenta Ozeki (Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, Virtual Conference / Alexandria, VA, USA, January 9 - 12, 2022, 2022)

Reforming an Envy-Free Matching - Takehiro Ito; Yuni Iwamasa; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi; Yuta Nozaki; Yoshio Okamoto; Kenta Ozeki (CoRR, 2022)

On Reachable Assignments under Dichotomous Preferences - Takehiro Ito; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi; Yuta Nozaki; Yoshio Okamoto; Kenta Ozeki (CoRR, 2022)

Rerouting Planar Curves and Disjoint Paths - Takehiro Ito; Yuni Iwamasa; Naonori Kakimura; Yusuke Kobayashi; Shun-ichi Maezawa; Yuta Nozaki; Yoshio Okamoto; Kenta Ozeki (CoRR, 2022)

Reconfiguration of colorings in triangulations of the sphere - Takehiro Ito; Yuni Iwamasa; Yusuke Kobayashi; Shun-ichi Maezawa; Yuta Nozaki; Yoshio Okamoto; Kenta Ozeki (CoRR, 2022)

2-Factors of cubic bipartite graphs - Nastaran Haghparast; Kenta Ozeki (Discret. Math., 2021)

Proper Colorings of Plane Quadrangulations Without Rainbow Faces - Kengo Enami; Kenta Ozeki; Tomoki Yamaguchi (Graphs Comb., 2021)

A Note on Enumeration of 3-Edge-Connected Spanning Subgraphs in Plane Graphs - Yasuko Matsui; Kenta Ozeki (IEICE Trans. Inf. Syst., 2021)

Single-conflict colouring - Zdenek Dvorák; Louis Esperet; Ross J. Kang; Kenta Ozeki (J. Graph Theory, 2021)

Monotone edge flips to an orientation of maximum edge-connectivity à la Nash-Williams - Takehiro Ito; Yuni Iwamasa; Naonori Kakimura; Naoyuki Kamiyama; Yusuke Kobayashi; Shun-ichi Maezawa; Yuta Nozaki; Yoshio Okamoto; Kenta Ozeki (CoRR, 2021)

Thomassen's conjecture for line graphs of 3-hypergraphs - Binlong Li; Kenta Ozeki; Zdenek Ryjácek; Petr Vrána (Discret. Math., 2020)

On minimum leaf spanning trees and a criticality notion - Kenta Ozeki; Gábor Wiener; Carol T. Zamfirescu (Discret. Math., 2020)

Long Paths in Bipartite Graphs and Path-Bistar Bipartite Ramsey Numbers - Michitaka Furuya; Shun-ichi Maezawa; Kenta Ozeki (Graphs Comb., 2020)

A complete bipartite graph without properly colored cycles of length four - Roman Cada; Kenta Ozeki; Kiyoshi Yoshimoto (J. Graph Theory, 2020)

Orientations of graphs avoiding given lists on out-degrees - Saieed Akbari; Mina Dalirrooyfard; K. Ehsani; Kenta Ozeki; R. Sherkati (J. Graph Theory, 2020)

Connected odd factors of graphs - Nastaran Haghparast; Mikio Kano; Shun-ichi Maezawa; Kenta Ozeki (Australas. J Comb., 2019)

Types of triangle in Hamiltonian triangulations and an application to domination and k-walks - Gunnar Brinkmann; Kenta Ozeki; Nico Van Cleemput (Ars Math. Contemp., 2019)

A Degree Sum Condition on the Order, the Connectivity and the Independence Number for Hamiltonicity - Shuya Chiba; Michitaka Furuya; Kenta Ozeki; Masao Tsugaki; Tomoki Yamashita (Electron. J. Comb., 2019)

[a, b]-factors of graphs on surfaces - Ryota Matsubara; Haruhide Matsuda; Nana Matsuo; Kenta Noguchi; Kenta Ozeki (Discret. Math., 2019)

On the minimum leaf number of cubic graphs - Jan Goedgebeur; Kenta Ozeki; Nico Van Cleemput; Gábor Wiener (Discret. Math., 2019)

Highly edge-connected factors using given lists on degrees - Saieed Akbari; Morteza Hasanvand; Kenta Ozeki (J. Graph Theory, 2019)

Spanning bipartite quadrangulations of even triangulations - Atsuhiro Nakamoto; Kenta Noguchi; Kenta Ozeki (J. Graph Theory, 2019)

Hamiltonicity of planar graphs with a forbidden minor - Mark N. Ellingham; Emily Abernethy Marshall; Kenta Ozeki; Shoichi Tsuchiya (J. Graph Theory, 2019)

A note on a Brooks' type theorem for DP?coloring - Seog-Jin Kim; Kenta Ozeki (J. Graph Theory, 2019)

Extension to 3-Colorable Triangulations - Atsuhiro Nakamoto; Kenta Noguchi; Kenta Ozeki (SIAM J. Discret. Math., 2019)

Book Embedding of Graphs on the Projective Plane - Kenta Ozeki; Atsuhiro Nakamoto; Takayuki Nozawa (SIAM J. Discret. Math., 2019)

On upper bounds for the independent transversal domination number - Christoph Brause; Michael A. Henning; Kenta Ozeki; Ingo Schiermeyer; Elkin Vumar (Discret. Appl. Math., 2018)

Pairs of forbidden subgraphs and 2-connected supereulerian graphs - Roman Cada; Kenta Ozeki; Liming Xiong; Kiyoshi Yoshimoto (Discret. Math., 2018)

Non-hamiltonian triangulations with distant separating triangles - Kenta Ozeki; Carol T. Zamfirescu (Discret. Math., 2018)

A sufficient condition for DP-4-colorability - Seog-Jin Kim; Kenta Ozeki (Discret. Math., 2018)

Hamiltonian properties of polyhedra with few 3-cuts - A survey - Kenta Ozeki; Nico Van Cleemput; Carol T. Zamfirescu (Discret. Math., 2018)

3-dynamic coloring of planar triangulations - Yoshihiro Asayama; Yuki Kawasaki; Seog-Jin Kim; Atsuhiro Nakamoto; Kenta Ozeki (Discret. Math., 2018)

Grünbaum colorings of even triangulations on surfaces - Michal Kotrbcík; Naoki Matsumoto; Bojan Mohar; Atsuhiro Nakamoto; Kenta Noguchi; Kenta Ozeki; Andrej Vodopivec (J. Graph Theory, 2018)

Decomposing planar cubic graphs - Arthur Hoffmann-Ostenhof; Tomás Kaiser; Kenta Ozeki (J. Graph Theory, 2018)

On homeomorphically irreducible spanning trees in cubic graphs - Arthur Hoffmann-Ostenhof; Kenta Noguchi; Kenta Ozeki (J. Graph Theory, 2018)

Sufficient conditions for the existence of a path-factor which are related to odd components - Yoshimi Egawa; Michitaka Furuya; Kenta Ozeki (J. Graph Theory, 2018)

Every 4-Connected Graph with Crossing Number 2 is Hamiltonian - Kenta Ozeki; Carol T. Zamfirescu (SIAM J. Discret. Math., 2018)

Hamiltonicity of Graphs on Surfaces in Terms of Toughness and Scattering Number - A Survey - Kenta Ozeki (Discrete and Computational Geometry, Graphs, and Games - 21st Japanese Conference, JCDCGGG 2018, Quezon City, Philippines, September 1-3, 2018, Revised Selected Papers, 2018)

Least conflict choosability - Zdenek Dvorák; Louis Esperet; Ross J. Kang; Kenta Ozeki (CoRR, 2018)

On the minimum leaf number of cubic graphs - Jan Goedgebeur; Kenta Ozeki; Nico Van Cleemput; Gábor Wiener (CoRR, 2018)

Coloring of locally planar graphs with one color class small - Atsuhiro Nakamoto; Kenta Ozeki (Australas. J Comb., 2017)

On two conjectures about the proper connection number of graphs - Fei Huang; Xueliang Li; Zhongmei Qin; Colton Magnant; Kenta Ozeki (Discret. Math., 2017)

Matching Extension Missing Vertices and Edges in Triangulations of Surfaces - Ken-ichi Kawarabayashi; Kenta Ozeki; Michael D. Plummer (J. Graph Theory, 2017)

On Dominating Even Subgraphs in Cubic Graphs - Roman Cada; Shuya Chiba; Kenta Ozeki; Kiyoshi Yoshimoto (SIAM J. Discret. Math., 2017)

Plane Triangulations Without a Spanning Halin Subgraph II - Guantao Chen; Hikoe Enomoto; Kenta Ozeki; Shoichi Tsuchiya (SIAM J. Discret. Math., 2017)

m-dominating k-trees of graphs - Mikio Kano; Kenta Ozeki; Masao Tsugaki; Guiying Yan (Discret. Math., 2016)

Decomposing plane cubic graphs - Kenta Ozeki; Dong Ye (Eur. J. Comb., 2016)

Vertex Coloring of Graphs by Total 2-Weightings - Jonathan Hulgan; Jeno Lehel; Kenta Ozeki; Kiyoshi Yoshimoto (Graphs Comb., 2016)

Cyclic 4-Colorings of Graphs on Surfaces - Atsuhiro Nakamoto; Kenta Noguchi; Kenta Ozeki (J. Graph Theory, 2016)

5-Connected Toroidal Graphs are Hamiltonian-Connected - Ken-ichi Kawarabayashi; Kenta Ozeki (SIAM J. Discret. Math., 2016)

A Characterization of K\(_2, 4\)-Minor-Free Graphs - Mark N. Ellingham; Emily Abernethy Marshall; Kenta Ozeki; Shoichi Tsuchiya (SIAM J. Discret. Math., 2016)

Spanning k-trees of Bipartite Graphs - Mikio Kano; Kenta Ozeki; Kazuhiro Suzuki; Masao Tsugaki; Tomoki Yamashita (Electron. J. Comb., 2015)

2-factors with bounded number of components in claw-free graphs - Kenta Ozeki; Zdenek Ryjácek; Kiyoshi Yoshimoto (Discret. Math., 2015)

{0, 2}-Degree free spanning forests in graphs - Saieed Akbari; Kenta Ozeki; Alireza Rezaei; Rahmtin Rotabi; Sara Sabour (Discret. Math., 2015)

The Chromatic Index of a Claw-Free Graph Whose Core has Maximum Degree 2 - Saieed Akbari; Maryam Ghanbari; Kenta Ozeki (Graphs Comb., 2015)

The Existence of Semi-colorings in a Graph - Michitaka Furuya; Masaru Kamada; Kenta Ozeki (Graphs Comb., 2015)

Spanning k-Forests with Large Components in K\(_1, k+1\)-Free Graphs - Kenta Ozeki; Takeshi Sugiyama (Graphs Comb., 2015)

A Toughness Condition for a Spanning Tree With Bounded Total Excesses - Kenta Ozeki (Graphs Comb., 2015)

4-connected projective-planar graphs are Hamiltonian-connected - Ken-ichi Kawarabayashi; Kenta Ozeki (J. Comb. Theory B, 2015)

Equivalence of Jackson's and Thomassen's conjectures - Roman Cada; Shuya Chiba; Kenta Ozeki; Petr Vrána; Kiyoshi Yoshimoto (J. Comb. Theory B, 2015)

Spanning Trees with Vertices Having Large Degrees - Yoshimi Egawa; Kenta Ozeki (J. Graph Theory, 2015)

A Relationship Between Thomassen's Conjecture and Bondy's Conjecture - Roman Cada; Shuya Chiba; Kenta Ozeki; Petr Vrána; Kiyoshi Yoshimoto (SIAM J. Discret. Math., 2015)

Plane Triangulations Without a Spanning Halin Subgraph: Counterexamples to the Lovász-Plummer Conjecture on Halin Graphs - Guantao Chen; Hikoe Enomoto; Kenta Ozeki; Shoichi Tsuchiya (SIAM J. Discret. Math., 2015)

Extension to Even Triangulations - Atsuhiro Nakamoto; Kenta Noguchi; Kenta Ozeki (SIAM J. Discret. Math., 2015)

A necessary and sufficient condition for the existence of a spanning tree with specified vertices having large degrees - Yoshimi Egawa; Kenta Ozeki (Comb., 2014)

On the ratio of the domination number and the independent domination number in graphs - Michitaka Furuya; Kenta Ozeki; Akinari Sasaki (Discret. Appl. Math., 2014)

2-edge-Hamiltonian-connectedness of 4-connected plane graphs - Kenta Ozeki; Petr Vrána (Eur. J. Comb., 2014)

Spanning Trees with a Bounded Number of Branch Vertices in a Claw-Free Graph - Haruhide Matsuda; Kenta Ozeki; Tomoki Yamashita (Graphs Comb., 2014)

Spanning closed walks and TSP in 3-connected planar graphs - Ken-ichi Kawarabayashi; Kenta Ozeki (J. Comb. Theory B, 2014)

Improved Upper Bounds for Gallai-Ramsey Numbers of Paths and Cycles - Martin Hall; Colton Magnant; Kenta Ozeki; Masao Tsugaki (J. Graph Theory, 2014)

Forbidden Subgraphs Generating Almost the Same Sets - Shinya Fujita; Michitaka Furuya; Kenta Ozeki (Comb. Probab. Comput., 2013)

Forbidden induced subgraphs for near perfect matchings - Katsuhiro Ota; Kenta Ozeki; Gabriel Sueiro (Discret. Math., 2013)

Hamiltonian cycles in bipartite toroidal graphs with a partite set of degree four vertices - Jun Fujisawa; Atsuhiro Nakamoto; Kenta Ozeki (J. Comb. Theory B, 2013)

A simpler proof for the two disjoint odd cycles theorem - Ken-ichi Kawarabayashi; Kenta Ozeki (J. Comb. Theory B, 2013)

4, 5 Is Not Coverable: A Counterexample to a Conjecture of Kaiser and Škrekovski - Roman Cada; Shuya Chiba; Kenta Ozeki; Petr Vrána; Kiyoshi Yoshimoto (SIAM J. Discret. Math., 2013)

Spanning Trees with Bounded Maximum Degrees of Graphs on Surfaces - Kenta Ozeki (SIAM J. Discret. Math., 2013)

4-connected projective-planar graphs are hamiltonian-connected - Ken-ichi Kawarabayashi; Kenta Ozeki (Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, New Orleans, Louisiana, USA, January 6-8, 2013, 2013)

Spanning trees with a bounded number of leaves in a claw-free graph - Mikio Kano; Aung Kyaw; Haruhide Matsuda; Kenta Ozeki; Akira Saito; Tomoki Yamashita (Ars Comb., 2012)

2-factors and independent sets on claw-free graphs - Roman Kuzel; Kenta Ozeki; Kiyoshi Yoshimoto (Discret. Math., 2012)

Length of Longest Cycles in a Graph Whose Relative Length is at Least Two - Kenta Ozeki; Tomoki Yamashita (Graphs Comb., 2012)

Spanning trees in 3-connected K\(_3, t\)-minor-free graphs - Katsuhiro Ota; Kenta Ozeki (J. Comb. Theory B, 2012)

Hamiltonian cycles in bipartite quadrangulations on the torus - Atsuhiro Nakamoto; Kenta Ozeki (J. Graph Theory, 2012)

Claw-free graphs and 2-factors that separate independent vertices - Ralph J. Faudree; Colton Magnant; Kenta Ozeki; Kiyoshi Yoshimoto (J. Graph Theory, 2012)

Book Embedding of Toroidal Bipartite Graphs - Atsuhiro Nakamoto; Katsuhiro Ota; Kenta Ozeki (SIAM J. Discret. Math., 2012)

Spanning closed walks and TSP in 3-connected planar graphs - Ken-ichi Kawarabayashi; Kenta Ozeki (Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012, Kyoto, Japan, January 17-19, 2012, 2012)

Dominating cycles in triangle-free graphs - Kenta Ozeki; Tomoki Yamashita (Ars Comb., 2011)

Forbidden induced subgraphs for star-free graphs - Jun Fujisawa; Katsuhiro Ota; Kenta Ozeki; Gabriel Sueiro (Discret. Math., 2011)

Hamilton cycles in 4-connected troidal triangulations - Ken-ichi Kawarabayashi; Kenta Ozeki (Electron. Notes Discret. Math., 2011)

Spanning Trees: A Survey - Kenta Ozeki; Tomoki Yamashita (Graphs Comb., 2011)

Non-separating subgraphs after deleting many disjoint paths - Ken-ichi Kawarabayashi; Kenta Ozeki (J. Comb. Theory B, 2011)

2- and 3-factors of graphs on surfaces - Ken-ichi Kawarabayashi; Kenta Ozeki (J. Graph Theory, 2011)

4-connected triangulations and 4-orderedness - Raiji Mukae; Kenta Ozeki (Discret. Math., 2010)

Set-orderedness as a generalization of k-orderedness and cyclability - Keishi Ishii; Kenta Ozeki; Kiyoshi Yoshimoto (Discret. Math., 2010)

Rainbow Generalizations of Ramsey Theory: A Survey - Shinya Fujita; Colton Magnant; Kenta Ozeki (Graphs Comb., 2010)

A k-Tree Containing Specified Vertices - Shuya Chiba; Ryota Matsubara; Kenta Ozeki; Masao Tsugaki (Graphs Comb., 2010)

A Spanning Tree with High Degree Vertices - Kenta Ozeki; Tomoki Yamashita (Graphs Comb., 2010)

The independence number condition for the existence of a spanning f-tree - Hikoe Enomoto; Kenta Ozeki (J. Graph Theory, 2010)

A simple algorithm for 4-coloring 3-colorable planar graphs - Ken-ichi Kawarabayashi; Kenta Ozeki (Theor. Comput. Sci., 2010)

Hamiltonian cycles and dominating cycles passing through a linear forest - Kenta Ozeki; Tomoki Yamashita (Discret. Math., 2009)

A degree sum condition for graphs to be prism hamiltonian - Kenta Ozeki (Discret. Math., 2009)

Spanning trees in 3-connected K\(_3, t\)-minor-free graphs - Katsuhiro Ota; Kenta Ozeki (Electron. Notes Discret. Math., 2009)

On relative length of longest paths and cycles - Kenta Ozeki; Masao Tsugaki; Tomoki Yamashita (J. Graph Theory, 2009)

Long cycles in graphs without hamiltonian paths - Ken-ichi Kawarabayashi; Kenta Ozeki; Tomoki Yamashita (Discret. Math., 2008)

A Degree Sum Condition Concerning the Connectivity and the Independence Number of a Graph - Kenta Ozeki; Tomoki Yamashita (Graphs Comb., 2008)